1647 search results - page 170 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
288
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
163
click to vote
PREMI
2005
Springer
15 years 10 months ago
2005
Springer
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
157
Voted
JMLR
2010
14 years 12 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
180
Voted
HSNMC
2003
Springer
15 years 10 months ago
2003
Springer
Various Internet applications involve multiple parties and usually adopt a one-to-many communication paradigm (multicast). The presence of multiple receivers in a multicast session...
204
click to vote
Publication
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...