Sciweavers

92 search results - page 16 / 19
» Optimal Multi-Paragraph Text Segmentation by Dynamic Program...
Sort
View
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 9 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
CVPR
2007
IEEE
14 years 10 months ago
Enhanced Level Building Algorithm for the Movement Epenthesis Problem in Sign Language Recognition
One of the hard problems in automated sign language recognition is the movement epenthesis (me) problem. Movement epenthesis is the gesture movement that bridges two consecutive s...
Ruiduo Yang, Sudeep Sarkar, Barbara L. Loeding
FSKD
2007
Springer
193views Fuzzy Logic» more  FSKD 2007»
14 years 2 months ago
Panoramic Background Model under Free Moving Camera
segmentation of moving regions in outdoor environment under a moving camera is a fundamental step in many vision systems including automated visual surveillance, human-machine int...
Naveed I. Rao, Huijun Di, Guangyou Xu
ICSOC
2010
Springer
13 years 6 months ago
Adaptive Management of Composite Services under Percentile-Based Service Level Agreements
We present a brokering service for the adaptive management of composite services. The goal of this broker is to dynamically adapt at runtime the composite service configuration, ...
Valeria Cardellini, Emiliano Casalicchio, Vincenzo...
CVPR
2007
IEEE
14 years 2 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...