Sciweavers

587 search results - page 107 / 118
» Theory of matching pursuit
Sort
View
PODS
2009
ACM
113views Database» more  PODS 2009»
14 years 8 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
KDD
2002
ACM
196views Data Mining» more  KDD 2002»
14 years 7 months ago
Comparing Two Recommender Algorithms with the Help of Recommendations by Peers
Abstract. Since more and more Web sites, especially sites of retailers, offer automatic recommendation services using Web usage mining, evaluation of recommender algorithms has bec...
Andreas Geyer-Schulz, Michael Hahsler
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 7 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
ICFP
2003
ACM
14 years 7 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
ICCAD
2006
IEEE
139views Hardware» more  ICCAD 2006»
14 years 4 months ago
Analog placement with symmetry and other placement constraints
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
Yiu-Cheong Tam, Evangeline F. Y. Young, Chris C. N...