Sciweavers

401 search results - page 75 / 81
» Algorithms for a Simple Point Placement Problem
Sort
View
CVPR
2003
IEEE
14 years 9 months ago
Learning epipolar geometry from image sequences
We wish to determine the epipolar geometry of a stereo camera pair from image measurements alone. This paper describes a solution to this problem which does not require a parametr...
Yonatan Wexler, Andrew W. Fitzgibbon, Andrew Zisse...
GD
2003
Springer
14 years 18 days ago
Fixed-Location Circular-Arc Drawing of Planar Graphs
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
Alon Efrat, Cesim Erten, Stephen G. Kobourov
SIGMETRICS
2010
ACM
195views Hardware» more  SIGMETRICS 2010»
13 years 11 months ago
CWS: a model-driven scheduling policy for correlated workloads
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
PRL
2010
188views more  PRL 2010»
13 years 5 months ago
Sparsity preserving discriminant analysis for single training image face recognition
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...
Lishan Qiao, Songcan Chen, Xiaoyang Tan
SIGIR
1998
ACM
13 years 11 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...