Sciweavers

215 search results - page 24 / 43
» Approximating Geometrical Graphs via
Sort
View
COMPGEOM
2005
ACM
13 years 11 months ago
On the exact computation of the topology of real algebraic curves
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
Raimund Seidel, Nicola Wolpert
CVPR
2009
IEEE
14 years 4 months ago
Trajectory parsing by cluster sampling in spatio-temporal graph
The objective of this paper is to parse object trajectories in surveillance video against occlusion, interruption, and background clutter. We present a spatio-temporal graph (ST-G...
Xiaobai Liu, Liang Lin, Song Chun Zhu, Hai Jin
CGI
1998
IEEE
14 years 2 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 10 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
INFOCOM
2009
IEEE
14 years 4 months ago
Prize-Collecting Data Fusion for Cost-Performance Tradeoff in Distributed Inference
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
Animashree Anandkumar, Meng Wang, Lang Tong, Anant...