Sciweavers

226 search results - page 28 / 46
» A Practical Algorithm to Find the Best Subsequence Patterns
Sort
View
COCOA
2008
Springer
13 years 9 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
MONET
2008
77views more  MONET 2008»
13 years 7 months ago
On Relay Node Placement and Assignment for Two-tiered Wireless Networks
Wireless networks that operate on batteries are imposed with energy constraints and long distance communications between nodes are not desirable. Implementing Relay Nodes (RNs) can...
Wenxuan Guo, Xin-Ming Huang, Wenjing Lou, Cao Lian...
CVPR
1997
IEEE
14 years 9 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
CVPR
2006
IEEE
14 years 9 months ago
Optimal Pose for Face Recognition
Researchers in psychology have well studied the impact of the pose of a face as perceived by humans, and concluded that the so-called 3/4 view, halfway between the front view and ...
Xiaoming Liu 0002, Jens Rittscher, Tsuhan Chen
CVPR
2005
IEEE
14 years 9 months ago
A Minimal Solution for Relative Pose with Unknown Focal Length
Assume that we have two perspective images with known intrinsic parameters except for an unknown common focal length. It is a minimally constrained problem to find the relative or...
Henrik Stewénius, David Nistér, Fred...