Abstract: Systems, apparatuses and methods may provide for replacing floating point matrix multiplication operations with an approximation algorithm or computation in applications that involve sparse codes and neural networks. The system may replace floating point matrix multiplication operations in sparse code applications and neural network applications with an approximation computation that applies an equivalent number of addition and/or subtraction operations.

Abstract: The makeup scheme recommendation method provided by embodiments of the present disclosure includes: acquiring makeup parameters of a user, the makeup parameters including at least one of an environment parameter, a body parameter, and a makeup time parameter; searching for a target makeup scheme matching the makeup parameters from a makeup scheme pool; optimizing the target makeup scheme in accordance with cosmetic information about the user, and generating a recommended makeup scheme, the cosmetic information being used to indicate cosmetics owned by the user; and providing the recommended makeup scheme to the user.

Abstract: Systems, apparatuses and methods may provide for replacing floating point matrix multiplication operations with an approximation algorithm or computation in applications that involve sparse codes and neural networks. The system may replace floating point matrix multiplication operations in sparse code applications and neural network applications with an approximation computation that applies an equivalent number of addition and/or subtraction operations.

Abstract: Embodiments of the present disclosure relate to a computer-implemented method. The method may include receiving identification information of a vehicle and identification information of a parking space to bind the vehicle with the parking space and generate binding information, receiving a time when the vehicle enters the parking space and a time when the vehicle exits the parking space, calculating a parking fee of the vehicle according to the time when the vehicle enters the parking space and the time when the vehicle exits the parking space, determining identification information of a shopping cart that corresponds to the vehicle according to the identification information of the vehicle, the binding information of the vehicle and the parking space, and a correspondence between the parking space and the shopping cart, and sending the parking fee of the vehicle to the shopping cart that corresponds to the identification information of the shopping cart.

Abstract: Systems, apparatuses and methods may provide for replacing floating point matrix multiplication operations with an approximation algorithm or computation in applications that involve sparse codes and neural networks. The system may replace floating point matrix multiplication operations in sparse code applications and neural network applications with an approximation computation that applies an equivalent number of addition and/or subtraction operations.

Abstract: Systems, apparatuses and methods may provide for replacing floating point matrix multiplication operations with an approximation algorithm or computation in applications that involve sparse codes and neural networks. The system may replace floating point matrix multiplication operations in sparse code applications and neural network applications with an approximation computation that applies an equivalent number of addition and/or subtraction operations.

Abstract: Systems, apparatuses and methods may provide for replacing floating point matrix multiplication operations with an approximation algorithm or computation in applications that involve sparse codes and neural networks. The system may replace floating point matrix multiplication operations in sparse code applications and neural network applications with an approximation computation that applies an equivalent number of addition and/or subtraction operations.

Abstract: Embodiments of the present disclosure relate to a computer-implemented method. The method may include receiving identification information of a vehicle and identification information of a parking space to bind the vehicle with the parking space and generate binding information, receiving a time when the vehicle enters the parking space and a time when the vehicle exits the parking space, calculating a parking fee of the vehicle according to the time when the vehicle enters the parking space and the time when the vehicle exits the parking space, determining identification information of a shopping cart that corresponds to the vehicle according to the identification information of the vehicle, the binding information of the vehicle and the parking space, and a correspondence between the parking space and the shopping cart, and sending the parking fee of the vehicle to the shopping cart that corresponds to the identification information of the shopping cart.

Abstract: The makeup scheme recommendation method provided by embodiments of the present disclosure includes: acquiring makeup parameters of a user, the makeup parameters including at least one of an environment parameter, a body parameter, and a makeup time parameter; searching for a target makeup scheme matching the makeup parameters from a makeup scheme pool; optimizing the target makeup scheme in accordance with cosmetic information about the user, and generating a recommended makeup scheme, the cosmetic information being used to indicate cosmetics owned by the user; and providing the recommended makeup scheme to the user.

Abstract: Systems, apparatuses and methods may provide for replacing floating point matrix multiplication operations with an approximation algorithm or computation in applications that involve sparse codes and neural networks. The system may replace floating point matrix multiplication operations in sparse code applications and neural network applications with an approximation computation that applies an equivalent number of addition and/or subtraction operations.

Abstract: In an embodiment, a processor a plurality of cores to independently execute instructions, the cores including a plurality of counters to store performance information, and a power controller coupled to the plurality of cores, the power controller having a logic to receive performance information from at least some of the plurality of counters, determine a number of cores to be active and a performance state for the number of cores for a next operation interval, based at least in part on the performance information and model information, and cause the number of cores to be active during the next operation interval, the performance information associated with execution of a workload on one or more of the plurality of cores. Other embodiments are described and claimed.

Abstract: Methods, systems, and computer-readable media for query simplification are provided. A search engine executed by a server receives a query. In response, the search engine determines whether the query is a long or hard query. For long or hard queries, the search engine drops one or more terms based on search engine logs. The search engine may utilize statistical models like machine translation, condition random fields, or max entropy, to identify the terms that should be dropped. The search engine obtains search results for the simplified query and transmits the results to a user that provided the query.

Abstract: In an embodiment, a processor a plurality of cores to independently execute instructions, the cores including a plurality of counters to store performance information, and a power controller coupled to the plurality of cores, the power controller having a logic to receive performance information from at least some of the plurality of counters, determine a number of cores to be active and a performance state for the number of cores for a next operation interval, based at least in part on the performance information and model information, and cause the number of cores to be active during the next operation interval, the performance information associated with execution of a workload on one or more of the plurality of cores. Other embodiments are described and claimed.

Abstract: In one embodiment, access a set of recency ranking data comprising one or more recency search queries and one or more recency search results, each of the recency search queries being recency-sensitive with respect to a particular time period and being associated with a query timestamp representing the time at which the recency search query is received at a search engine, each of the recency search results being generated by the search engine for one of the recency search queries and comprising one or more recency network resources. Construct a plurality of recency features from the set of recency ranking data. Train a first ranking model via machine learning using at least the recency features.

Abstract: Methods, systems, and computer-readable media for query simplification are provided. A search engine executed by a server receives a query. In response, the search engine determines whether the query is a long or hard query. For long or hard queries, the search engine drops one or more terms based on search engine logs. The search engine may utilize statistical models like machine translation, condition random fields, or max entropy, to identify the terms that should be dropped. The search engine obtains search results for the simplified query and transmits the results to a user that provided the query.

Abstract: In one embodiment, access a set of recency ranking data comprising one or more recency search queries and one or more recency search results, each of the recency search queries being recency-sensitive with respect to a particular time period and being associated with a query timestamp representing the time at which the recency search query is received at a search engine, each of the recency search results being generated by the search engine for one of the recency search queries and comprising one or more recency network resources. Construct a plurality of recency features from the set of recency ranking data. Train a first ranking model via machine learning using at least the recency features.

Abstract: To estimate, or predict, the relevance of items, or documents, in a set of search results, relevance information is extracted from user click data, and relational information among the documents as manifested by an aggregation of user clicks is determined from the click data. A supervised approach uses judgment information, such as human judgment information, as part of the training data used to generate a relevance predictor model, which minimizes the inherent noisiness of the click data collected from a commercial search engine.