Sciweavers

1012 search results - page 116 / 203
» Segment intersection searching problems in general settings
Sort
View
JUCS
2010
130views more  JUCS 2010»
14 years 10 months ago
On the Linear Number of Matching Substrings
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
Yo-Sub Han
CVPR
2004
IEEE
16 years 1 months ago
Incremental Density Approximation and Kernel-Based Bayesian Filtering for Object Tracking
Statistical density estimation techniques are used in many computer vision applications such as object tracking, background subtraction, motion estimation and segmentation. The pa...
Bohyung Han, Dorin Comaniciu, Ying Zhu, Larry S. D...
FGR
2004
IEEE
87views Biometrics» more  FGR 2004»
15 years 3 months ago
Transition Movement Models for Large Vocabulary Continuous Sign Language Recognition
The major challenges that sign language recognition (SLR) now faces are developing methods that solve large vocabulary continuous sign problems. In this paper, large vocabulary co...
Wen Gao, Gaolin Fang, Debin Zhao, Yiqiang Chen
WWW
2009
ACM
16 years 16 days ago
An axiomatic approach for result diversification
Understanding user intent is key to designing an effective ranking system in a search engine. In the absence of any explicit knowledge of user intent, search engines want to diver...
Sreenivas Gollapudi, Aneesh Sharma
SIGGRAPH
1994
ACM
15 years 4 months ago
Animating images with drawings
The work described here extends the power of 2D animation with a form of texture mapping conveniently controlled by line drawings. By tracing points, line segments, spline curves,...
Peter Litwinowicz, Lance Williams