Sciweavers

1190 search results - page 204 / 238
» On the Structure of Syntenic Distance
Sort
View
IDMS
2000
Springer
131views Multimedia» more  IDMS 2000»
14 years 12 days ago
Spatially Aware Local Communication in the RAUM System
In this paper, we propose a new paradigm for local communication between devices in Ubiquitous Computing environments, assuming a multitude of computerized everyday appliances comm...
Felix Hupfeld, Michael Beigl
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
13 years 10 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan
COMPGEOM
2006
ACM
13 years 10 months ago
On the ICP algorithm
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
Esther Ezra, Micha Sharir, Alon Efrat
ECAI
2008
Springer
13 years 10 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
ICB
2007
Springer
183views Biometrics» more  ICB 2007»
13 years 10 months ago
Factorial Hidden Markov Models for Gait Recognition
Gait recognition is an effective approach for human identification at a distance. During the last decade, the theory of hidden Markov models (HMMs) has been used successfully in th...
Changhong Chen, Jimin Liang, Haihong Hu, Licheng J...