Sciweavers

860 search results - page 99 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
ICRA
2005
IEEE
144views Robotics» more  ICRA 2005»
14 years 1 months ago
A Miniature Mobile Robot With a Color Stereo Camera System for Swarm Robotics Research
— In swarm robotics research, instead of using large size robots, it is often desirable to have multiple small size robots for saving valuable work space and making the maintaina...
Janne Haverinen, Mikko Parpala, Juha Röning
UAI
2003
13 years 9 months ago
Bayesian Hierarchical Mixtures of Experts
The Hierarchical Mixture of Experts (HME) is a well-known tree-structured model for regression and classification, based on soft probabilistic splits of the input space. In its o...
Christopher M. Bishop, Markus Svensén
33
Voted
DCOSS
2006
Springer
13 years 11 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
POPL
2010
ACM
14 years 5 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
ICLP
1997
Springer
14 years 13 hour ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...