Sciweavers

1951 search results - page 329 / 391
» An algorithm for improving graph partitions
Sort
View
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 2 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
CORR
2010
Springer
197views Education» more  CORR 2010»
14 years 8 months ago
Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents
—Autonomous wireless agents such as unmanned aerial vehicles, mobile base stations, or self-operating wireless nodes present a great potential for deployment in next-generation w...
Walid Saad, Zhu Han, Tamer Basar, Mérouane ...
88
Voted
COCO
2007
Springer
96views Algorithms» more  COCO 2007»
15 years 4 months ago
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
ICCV
2009
IEEE
14 years 8 months ago
Image annotation using multi-label correlated Green's function
Image annotation has been an active research topic in the recent years due to its potentially large impact on both image understanding and web/database image search. In this paper...
Hua Wang, Heng Huang, Chris H. Q. Ding
86
Voted
PODC
2005
ACM
15 years 3 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer