74 search results - page 13 / 15 » The Lower Tail of the Random Minimum Spanning Tree |
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
186
click to vote
ACID
2006
15 years 1 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
144
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
This paper presents a novel method for estimating the geospatial trajectory of a moving camera with unknown intrinsic parameters, in a city-scale urban environment. The proposed m...
ISCAS
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— We study leakage-power reduction in standby random access memories (SRAMs) during data-retention. An SRAM cell requires a minimum critical supply voltage (DRV) above wh...
CAAN
2006
Springer
15 years 3 months ago
2006
Springer
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...