Sciweavers

231 search results - page 26 / 47
» Context Matching for Compressed Terms
Sort
View
WIAMIS
2009
IEEE
14 years 2 months ago
Global motion estimation using variable block sizes and its application to object segmentation
Global motion is estimated either in the pixel domain or in block based domain. Until now, all the approaches regarding the latter are based on fixed sized blocks while the recent...
Marina Georgia Arvanitidou, Alexander Glantz, Andr...
ACCV
2006
Springer
14 years 1 months ago
Statistical Shape Models Using Elastic-String Representations
Abstract. To develop statistical models for shapes, we utilize an elastic string representation where curves (denoting shapes) can bend and locally stretch (or compress) to optimal...
Anuj Srivastava, Aastha Jain, Shantanu H. Joshi, D...
ICRA
2002
IEEE
110views Robotics» more  ICRA 2002»
14 years 10 days ago
Mobile Robot Localization using an Incremental Eigenspace Model
— When using appearance-based recognition for self-localization of mobile robots, the images obtained during the exploration of the environment need to be efficiently stored in t...
Matej Artac, Matjaz Jogan, Ales Leonardis
CONEXT
2007
ACM
13 years 11 months ago
A hybrid finite automaton for practical deep packet inspection
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
Michela Becchi, Patrick Crowley
SIGIR
2002
ACM
13 years 7 months ago
Unsupervised document classification using sequential information maximization
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...
Noam Slonim, Nir Friedman, Naftali Tishby