Sciweavers

690 search results - page 52 / 138
» Dense Admissible Sets
Sort
View
IPL
2006
116views more  IPL 2006»
14 years 11 months ago
Guarding galleries and terrains
Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficie...
Alon Efrat, Sariel Har-Peled
ARC
2012
Springer
317views Hardware» more  ARC 2012»
13 years 7 months ago
A High Throughput FPGA-Based Implementation of the Lanczos Method for the Symmetric Extremal Eigenvalue Problem
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
Abid Rafique, Nachiket Kapre, George A. Constantin...
CVPR
1997
IEEE
16 years 1 months ago
Disparity Component Matching for Visual Correspondence
We present a method for computing dense visual correspondence based on general assumptions about scene geometry. Our algorithm does not rely on correlation, and uses a variable re...
Yuri Boykov, Olga Veksler, Ramin Zabih
SAC
2009
ACM
15 years 6 months ago
Parameterless outlier detection in data streams
Outlyingness is a subjective concept relying on the isolation level of a (set of) record(s). Clustering-based outlier detection is a field that aims to cluster data and to detect...
Alice Marascu, Florent Masseglia
BMVC
2001
15 years 2 months ago
An Information Theoretic Approach to Statistical Shape Modelling
Statistical shape models have been used widely as a basis for segmenting and interpreting images. A major drawback of the approach is the need to establish a set of dense correspo...
Rhodri H. Davies, Timothy F. Cootes, Carole J. Twi...