15 search results - page 3 / 3 » A Linear Time Algorithm for Finding a Maximal Planar Subgrap... |
MOBIHOC
2002
ACM
14 years 7 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...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
ADHOCNOW
2009
Springer
13 years 8 months ago
2009
Springer
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...