Sciweavers

2124 search results - page 185 / 425
» An Efficient Framework for Order Optimization
Sort
View
NSDI
2004
15 years 8 months ago
Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays
Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high ...
Venugopalan Ramasubramanian, Emin Gün Sirer
ICDT
2005
ACM
128views Database» more  ICDT 2005»
16 years 1 days ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
ICIP
2007
IEEE
16 years 8 months ago
High Dimension Lattice Vector Quantizer Design for Generalized Gaussian Distributions
LVQ is a simple but powerful tool for vector quantization and can be viewed as a vector generalization of uniform scalar quantization. Like VQ, LVQ is able to take into account sp...
Leonardo H. Fonteles, Marc Antonini
CIKM
2009
Springer
15 years 10 months ago
Empirical justification of the gain and discount function for nDCG
The nDCG measure has proven to be a popular measure of retrieval effectiveness utilizing graded relevance judgments. However, a number of different instantiations of nDCG exist, d...
Evangelos Kanoulas, Javed A. Aslam
ML
2008
ACM
135views Machine Learning» more  ML 2008»
15 years 6 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget