224 search results - page 41 / 45 » G-graphs for the cage problem: a new upper bound |
92
Voted
SWAT
2004
Springer
15 years 3 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...
100
Voted
JCB
2000
14 years 10 months ago
2000
Multiple sequence alignments (MSAs) are frequently used in the study of families of protein sequences or DNA/RNA sequences. They are a fundamental tool for the understanding of th...
93
Voted
TMC
2011
14 years 5 months ago
2011
— Context information brings new opportunities for efficient and effective system resource management of mobile devices. In this work we focus on the use of context information t...
103
Voted
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
125
Voted
MOBIHOC
2004
ACM
15 years 9 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...