Sciweavers

882 search results - page 96 / 177
» Local Search for Very Large SAT Problems
Sort
View
CIKM
2008
Springer
15 years 6 months ago
Are click-through data adequate for learning web search rankings?
Learning-to-rank algorithms, which can automatically adapt ranking functions in web search, require a large volume of training data. A traditional way of generating training examp...
Zhicheng Dou, Ruihua Song, Xiaojie Yuan, Ji-Rong W...
SIGIR
2010
ACM
15 years 8 months ago
Self-taught hashing for fast similarity search
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
Dell Zhang, Jun Wang, Deng Cai, Jinsong Lu
CVPR
2009
IEEE
16 years 10 months ago
Reducing JointBoost-Based Multiclass Classification to Proximity Search
Boosted one-versus-all (OVA) classifiers are commonly used in multiclass problems, such as generic object recognition, biometrics-based identification, or gesture recognition. Join...
Alexandra Stefan (University of Texas at Arlington...
SAC
2006
ACM
15 years 4 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
DIALM
2004
ACM
124views Algorithms» more  DIALM 2004»
15 years 9 months ago
Localized techniques for broadcasting in wireless sensor networks
We present three localized techniques for broadcasting in large scale ad hoc networks, i.e., for the problem of disseminating a message from a source node to all the nodes in the ...
Lorenzo Orecchia, Alessandro Panconesi, Chiara Pet...