18306 search results - page 479 / 3662 » Algorithmics in Exponential Time |
170
Voted
CIKM
2001
Springer
16 years 2 days ago
2001
Springer
In a wireless environment, the bandwidth of the channels and the energy of the portable devices are limited. Data broadcast has become an excellent method for efficient data disse...
182
click to vote
JSAC
2007
15 years 7 months ago
2007
— In this paper, we introduce and evaluate novel adaptive schemes for neighbor discovery in Bluetooth-enabled ad-hoc networks. In an ad-hoc peer-to-peer setting, neighbor search ...
217
Voted
SIAMDM
2010
15 years 2 months ago
2010
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...
218
click to vote
MCS
2005
Springer
16 years 1 months ago
2005
Springer
Mixed Group Ranks is a parametric method for combining rank based classi ers that is eective for many-class problems. Its parametric structure combines qualities of voting methods...
200
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...