Sciweavers

1012 search results - page 12 / 203
» Segment intersection searching problems in general settings
Sort
View
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
14 years 1 months ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka
ICIP
2000
IEEE
14 years 8 months ago
Combined Dynamic Tracking and Recognition of Curves with Application to Road Detection
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
Frederic Guichard, Jean-Philippe Tarel
COR
2010
123views more  COR 2010»
13 years 7 months ago
Multi-dimensional bin packing problems with guillotine constraints
The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while ...
Rasmus Resen Amossen, David Pisinger
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 7 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
WWW
2005
ACM
14 years 8 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel