Sciweavers

2376 search results - page 249 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 9 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
WWW
2008
ACM
14 years 9 months ago
Using graphics processors for high-performance IR query processing
Web search engines are facing formidable performance challenges due to data sizes and query loads. The major engines have to process tens of thousands of queries per second over t...
Shuai Ding, Jinru He, Hao Yan, Torsten Suel
KDD
2008
ACM
150views Data Mining» more  KDD 2008»
14 years 8 months ago
Hypergraph spectral learning for multi-label classification
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
Liang Sun, Shuiwang Ji, Jieping Ye
EC
2008
103views ECommerce» more  EC 2008»
13 years 8 months ago
A Graphical Model for Evolutionary Optimization
We present a statistical model of empirical optimization that admits the creation of algorithms with explicit and intuitively defined desiderata. Because No Free Lunch theorems di...
Christopher K. Monson, Kevin D. Seppi
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 8 months ago
Improved results for a memory allocation problem
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
Leah Epstein, Rob van Stee