222 search results - page 12 / 45 » Locally Compact Path Spaces |
CEC
2008
IEEE
15 years 6 months ago
2008
IEEE
— The problem of robotic area coverage is applicable to many domains, such as search, agriculture, cleaning, and machine tooling. The robotic area coverage task is concerned with...
ICCV
2005
IEEE
16 years 1 months ago
2005
IEEE
We present a new approach to model visual scenes in image collections, based on local invariant features and probabilistic latent space models. Our formulation provides answers to...
CP
2003
Springer
15 years 5 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
111
click to vote
SIGIR
2004
ACM
15 years 5 months ago
2004
ACM
Document representation and indexing is a key problem for document analysis and processing, such as clustering, classification and retrieval. Conventionally, Latent Semantic Index...
105
click to vote
ICCAD
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract— Process variations make at-speed testing significantly more difficult. They cause subtle delay changes that are distributed rather than the localized nature of a trad...