Sciweavers

2069 search results - page 332 / 414
» Linear time algorithms for Clobber
Sort
View
PIMRC
2010
IEEE
15 years 4 months ago
On the feasibility of receive collaboration in wireless sensor networks
In this paper, a new type of collaboration in wireless sensor networks (WSN) is suggested that exploits array processing algorithms for better reception of a signal. For receive co...
Behnam Banitalebi, S. Sigg, M. Beigl
ACL
2009
15 years 4 months ago
A Novel Discourse Parser Based on Support Vector Machine Classification
This paper introduces a new algorithm to parse discourse within the framework of Rhetorical Structure Theory (RST). Our method is based on recent advances in the field of statisti...
David duVerle, Helmut Prendinger
CAD
2011
Springer
15 years 1 months ago
Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
Ramanathan Muthuganapathy, Gershon Elber, Gill Bar...
JMLR
2010
149views more  JMLR 2010»
15 years 1 months ago
Coherent Inference on Optimal Play in Game Trees
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
Philipp Hennig, David H. Stern, Thore Graepel
JMLR
2010
103views more  JMLR 2010»
15 years 1 months ago
Learning Nonlinear Dynamic Models from Non-sequenced Data
Virtually all methods of learning dynamic systems from data start from the same basic assumption: the learning algorithm will be given a sequence of data generated from the dynami...
Tzu-Kuo Huang, Le Song, Jeff Schneider