Sciweavers

2095 search results - page 368 / 419
» Improved pebbling bounds
Sort
View
WALCOM
2010
IEEE
260views Algorithms» more  WALCOM 2010»
13 years 8 months ago
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
CIKM
2010
Springer
13 years 8 months ago
Combining link and content for collective active learning
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
Lixin Shi, Yuhang Zhao, Jie Tang
COLT
2010
Springer
13 years 8 months ago
Following the Flattened Leader
We analyze the regret, measured in terms of log loss, of the maximum likelihood (ML) sequential prediction strategy. This "follow the leader" strategy also defines one o...
Wojciech Kotlowski, Peter Grünwald, Steven de...
COMPIMAGE
2010
Springer
13 years 8 months ago
On the Effects of Normalization in Adaptive MRF Hierarchies
Abstract. In this paper, we analyze the effects of energy normalization in adaptivehierarchy-based energy minimization methods. Adaptive hierarchies provide a nt multi-level abstra...
Albert Y. C. Chen, Jason J. Corso
ICPADS
2010
IEEE
13 years 7 months ago
M-cube: A Duty Cycle Based Multi-channel MAC Protocol with Multiple Channel Reservation for WSNs
In this paper, a duty cycle based multi-channel MAC protocol with multiple channel reservation, called M-cube, is proposed to tackle the triple hidden terminal problems. M-cube can...
Jinbao Li, Desheng Zhang, Longjiang Guo, Shouling ...