Sciweavers

15 search results - page 1 / 3
» A Simple Linear Ranking Algorithm Using Query Dependent Inte...
Sort
View
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 4 months ago
A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables
The LETOR website contains three information retrieval datasets used as a benchmark for testing machine learning ideas for ranking. Algorithms participating in the challenge are re...
Nir Ailon
ASPDAC
2009
ACM
164views Hardware» more  ASPDAC 2009»
13 years 11 months ago
Accounting for non-linear dependence using function driven component analysis
Majority of practical multivariate statistical analyses and optimizations model interdependence among random variables in terms of the linear correlation among them. Though linear...
Lerong Cheng, Puneet Gupta, Lei He
PDP
2008
IEEE
13 years 11 months ago
Load Balancing Distributed Inverted Files: Query Ranking
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
Carlos Gomez-Pantoja, Mauricio Marín
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
13 years 11 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri
ATAL
2007
Springer
13 years 11 months ago
Eliciting single-peaked preferences using comparison queries
Voting is a general method for aggregating the preferences of multiple agents. Each agent ranks all the possible alternatives, and based on this, an aggregate ranking of the alter...
Vincent Conitzer