1536 search results - page 86 / 308 » Approximately Dominating Representatives |
134
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
We present a completely automatic method for obtaining the approximate calibration of a camera (alignment to a world frame and focal length) from a single image of an unknown scene...
124
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
147
click to vote
IWQOS
2001
Springer
15 years 8 months ago
2001
Springer
The IETF’s Integrated Services (IntServ) architecture together with reservation aggregation provide a mechanism to support the quality-of-service demands of real-time flows in a...
145
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 ...
146
click to vote
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...