4913 search results - page 831 / 983 » Results and Perspectives of the G |
220
click to vote
SDM
2012
SIAM
13 years 9 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
221
click to vote
SDM
2012
SIAM
13 years 9 months ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
193
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
162
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Millions of users retrieve information from the Internet using search engines. Mining these user sessions can provide valuable information about the quality of user experience and...
167
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...