2600 search results - page 143 / 520 » Clustering with or without the Approximation |
194
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
190
click to vote
ISPD
2009
ACM
16 years 1 months ago
2009
ACM
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
147
click to vote
SIGECOM
2006
ACM
16 years 12 days ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
211
click to vote
ATAL
2005
Springer
16 years 11 hour ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
173
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...