7006 search results - page 340 / 1402 » Approximation Algorithms |
191
click to vote
DAWAK
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
216
click to vote
ENTCS
2008
15 years 7 months ago
2008
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
183
Voted
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
163
click to vote
AUTOMATICA
2006
15 years 7 months ago
2006
Two integrator backstepping designs are presented for digitally controlled continuous-time plants in special form. The controller designs are based on the Euler approximate discre...
200
click to vote
COMPGEOM
2004
ACM
16 years 14 days ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...