Sciweavers

95 search results - page 14 / 19
» Efficient Enumeration of Frequent Sequences
Sort
View
ANCS
2005
ACM
14 years 1 months ago
Segmented hash: an efficient hash table implementation for high performance networking subsystems
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
Sailesh Kumar, Patrick Crowley
VIS
2004
IEEE
187views Visualization» more  VIS 2004»
14 years 9 months ago
Methods for Efficient, High Quality Volume Resampling in the Frequency Domain
Resampling is a frequent task in visualization and medical imaging. It occurs whenever images or volumes are magnified, rotated, translated, or warped. Resampling is also an integ...
Aili Li, Klaus Mueller, Thomas Ernst
ICCV
2003
IEEE
14 years 9 months ago
Variational Stereovision and 3D Scene Flow Estimation with Statistical Similarity Measures
We present a common variational framework for dense depth recovery and dense three-dimensional motion field estimation from multiple video sequences, which is robust to camera spe...
Jean-Philippe Pons, Renaud Keriven, Olivier D. Fau...
IVC
2002
185views more  IVC 2002»
13 years 7 months ago
Path detection in video surveillance
This paper addresses the problem of automatically extracting frequently used pedestrian pathways from video sequences of natural outdoor scenes. Path models are learnt from the ac...
Dimitrios Makris, Tim Ellis
RECOMB
2010
Springer
13 years 5 months ago
Novel Definition and Algorithm for Chaining Fragments with Proportional Overlaps
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
Raluca Uricaru, Alban Mancheron, Eric Rivals