9842 search results - page 1684 / 1969 » The Complexity of the Matching-Cut Problem |
150
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
152
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
155
click to vote
PODS
2008
ACM
16 years 4 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
144
click to vote
MOBISYS
2008
ACM
16 years 4 months ago
2008
ACM
Adaptive transmit power control in 802.11 Wireless LANs (WLANs) on a per-link basis helps increase network capacity and improves battery life of Wifi-enabled mobile devices. Howev...
190
click to vote
MOBIHOC
2004
ACM
16 years 4 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 ...