115 search results - page 19 / 23 » The Complexity of List Ranking of Trees |
108
click to vote
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
JCDL
2004
ACM
15 years 3 months ago
2004
ACM
A large amount of research, technical and professional documents are available today in digital formats. Digital libraries are created to facilitate search and retrieval of inform...
CVPR
2007
IEEE
16 years 22 hour ago
2007
IEEE
In this paper, we present a large-scale object retrieval system. The user supplies a query object by selecting a region of a query image, and the system returns a ranked list of i...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
175
click to vote
Book
"This book has evolved from materials used in an undergraduate course intended for final year undergraduate students whose background includes at least one year's experie...