2252 search results - page 247 / 451 » Lower Bounds for Dynamic Algorithms |
140
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
149
click to vote
BMVC
1997
15 years 5 months ago
1997
In this paper we present an algorithm for structure and motion (SM) recovery under affine projection from video sequences. The algorithm tracks the motion of a single structure, b...
134
Voted
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
— We present SMART, a self-tuning, bandwidth-aware monitoring system that maximizes result precision of continuous aggregate queries over dynamic data streams. While prior approa...
121
click to vote
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
— Input-queued switches are used extensively in the design of high-speed routers. As switch speeds and sizes increase, the design of the switch scheduler becomes a primary challe...
125
Voted
CPM
1999
Springer
15 years 8 months ago
1999
Springer
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...