Sciweavers

1091 search results - page 53 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
ISMVL
2009
IEEE
161views Hardware» more  ISMVL 2009»
14 years 2 months ago
Mining Approximative Descriptions of Sets Using Rough Sets
Using concepts from rough set theory we investigate the existence of approximative descriptions of collections of objects that can be extracted from data sets, a problem of intere...
Dan A. Simovici, Selim Mimaroglu
ICML
1999
IEEE
14 years 8 months ago
Approximation Via Value Unification
: Numerical function approximation over a Boolean domain is a classical problem with wide application to data modeling tasks and various forms of learning. A great many function ap...
Paul E. Utgoff, David J. Stracuzzi
KAIS
2008
150views more  KAIS 2008»
13 years 7 months ago
A survey on algorithms for mining frequent itemsets over data streams
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
James Cheng, Yiping Ke, Wilfred Ng
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 8 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
IPSN
2007
Springer
14 years 1 months ago
Approximate isocontours and spatial summaries for sensor networks
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
Sorabh Gandhi, John Hershberger, Subhash Suri