42 search results - page 3 / 9 » Bisimulation on Speed: Lower Time Bounds |
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
115
click to vote
TMC
2010
14 years 4 months ago
2010
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
91
Voted
JCO
2007
14 years 9 months ago
2007
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...