Sciweavers

140 search results - page 13 / 28
» Random projection algorithms for convex set intersection pro...
Sort
View
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
15 years 1 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
CG
1999
Springer
14 years 11 months ago
A visibility algorithm for hybrid geometry- and image-based modeling and rendering
Hybrid geometry- and image-based modeling and rendering systems use photographs taken of a real-world environment and mapped onto the surfaces of a 3D model to achieve photorealis...
Thomas A. Funkhouser
CORR
2002
Springer
160views Education» more  CORR 2002»
14 years 11 months ago
Structure from Motion: Theoretical Foundations of a Novel Approach Using Custom Built Invariants
We rephrase the problem of 3D reconstruction from images in terms of intersections of projections of orbits of custom built Lie groups actions. We then use an algorithmic method b...
Pierre-Louis Bazin, Mireille Boutin
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 4 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
ICML
2007
IEEE
16 years 12 days ago
A fast linear separability test by projection of positive points on subspaces
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal