Sciweavers

765 search results - page 17 / 153
» Empirical Design of Geometric Algorithms
Sort
View
PAMI
2008
174views more  PAMI 2008»
14 years 10 months ago
Geometric Observers for Dynamically Evolving Curves
Abstract-- This paper proposes a deterministic observer design for visual tracking based on non-parametric implicit (level-set) curve descriptions. The observer is continuous-discr...
Marc Niethammer, Patricio A. Vela, Allen Tannenbau...
VISUALIZATION
2002
IEEE
15 years 4 months ago
Computing Singularities of 3D Vector Fields with Geometric Algebra
Critical points of a vector field are key to their characterization. Not only their positions but also their indexes are crucial for understanding vector fields. Considerable wo...
Stephen Mann, Alyn P. Rockwood
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
15 years 5 months ago
On Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar ...

Publication
402views
16 years 10 months ago
Geometric Broadcast Protocol for Heterogeneous Wireless Networks
We present Geometric Broadcast for Heterogeneous Sensor Networks (GBS), a novel broad- casting protocol for heterogeneous wireless sensor and actor networks. While broadcasting is ...
V. Paruchuri, A. Durresi, Raj Jain
TIP
2010
155views more  TIP 2010»
14 years 10 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He