Sciweavers

3134 search results - page 134 / 627
» Computing full disjunctions
Sort
View
BROADNETS
2006
IEEE
16 years 10 days ago
Coverage with Connectivity in Wireless Sensor Networks
— In this paper, we study coverage with connectivity properties in large wireless sensor networks. We consider three classes: full coverage with connectivity, partial coverage wi...
Xin Liu
ICMCS
2006
IEEE
310views Multimedia» more  ICMCS 2006»
16 years 9 days ago
An Optimal and Statistically Robust Correlation Technique for Block Based Motion Estimation
In this paper we propose an optimal and robust correlation technique for the local motion estimation purposes. It is based on the maximization of a statistical robust matching fun...
Fedwa Essannouni, Rachid Oulad Haj Thami, Ahmed Sa...
IROS
2006
IEEE
132views Robotics» more  IROS 2006»
16 years 9 days ago
Closing a Million-Landmarks Loop
— We present an improved version of the treemap SLAM algorithm which uses Cholesky factors for representing Gaussians and a Hierarchical Tree Partitioning algorithm derived from ...
Udo Frese, Lutz Schroder
ECAI
2004
Springer
15 years 11 months ago
The Semantic Grid: Myth Busting and Bridge Building
The Semantic Grid is an extension of the current Grid in which information and services are given well-defined meaning, better enabling computers and people to work in cooperation....
Carole A. Goble, David De Roure
FOSSACS
2004
Springer
15 years 11 months ago
A Game Semantics of Local Names and Good Variables
We describe a game semantics for local names in a functional setting. It is based on a category of dialogue games acted upon by the automorphism group of the natural numbers; this ...
James Laird