Sciweavers

2316 search results - page 318 / 464
» The many forms of hypercomputation
Sort
View
KDD
2003
ACM
130views Data Mining» more  KDD 2003»
16 years 5 months ago
Towards systematic design of distance functions for data mining applications
Distance function computation is a key subtask in many data mining algorithms and applications. The most effective form of the distance function can only be expressed in the conte...
Charu C. Aggarwal
RECOMB
2008
Springer
16 years 5 months ago
Constructing Treatment Portfolios Using Affinity Propagation
A key problem of interest to biologists and medical researchers is the selection of a subset of queries or treatments that provide maximum utility for a population of targets. For ...
Delbert Dueck, Brendan J. Frey, Nebojsa Jojic, Vla...
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 5 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
167
Voted
SIGMOD
2003
ACM
175views Database» more  SIGMOD 2003»
16 years 5 months ago
WinMagic : Subquery Elimination Using Window Aggregation
Database queries often take the form of correlated SQL queries. Correlation refers to the use of values from the outer query block to compute the inner subquery. This is a conveni...
Calisto Zuzarte, Hamid Pirahesh, Wenbin Ma, Qi Che...
ICFP
2005
ACM
16 years 5 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney