Sciweavers

882 search results - page 77 / 177
» Local Search for Very Large SAT Problems
Sort
View
SIGIR
2006
ACM
15 years 11 months ago
Large scale semi-supervised linear SVMs
Large scale learning is often realistic only in a semi-supervised setting where a small set of labeled examples is available together with a large collection of unlabeled data. In...
Vikas Sindhwani, S. Sathiya Keerthi
CIKM
2004
Springer
15 years 11 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel
DSMML
2004
Springer
15 years 11 months ago
Redundant Bit Vectors for Quickly Searching High-Dimensional Regions
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
Jonathan Goldstein, John C. Platt, Christopher J. ...
ICALP
1999
Springer
15 years 10 months ago
Online Data Structures in External Memory
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
Jeffrey Scott Vitter
ICDCS
1999
IEEE
15 years 10 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta