2924 search results - page 346 / 585 » Lower Bounds in Distributed Computing |
128
click to vote
PPSN
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...
149
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
166
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
155
click to vote
COMGEO
2012
ACM
14 years 12 days ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
184
Voted
ICDE
2012
IEEE
13 years 7 months ago
2012
IEEE
—Dimensionality reduction is essential in text mining since the dimensionality of text documents could easily reach several tens of thousands. Most recent efforts on dimensionali...