Sciweavers

100 search results - page 8 / 20
» A simple entropy-based algorithm for planar point location
Sort
View
CVPR
2011
IEEE
13 years 2 months ago
A Brute-Force Algorithm for Reconstructing a Scene from Two Projections
Is the real problem in finding the relative orientation of two viewpoints the correspondence problem? We argue that this is only one difficulty. Even with known correspondences,...
Olof Enqvist, Fangyuan Jiang, Fredrik Kahl
ADHOC
2005
95views more  ADHOC 2005»
13 years 10 months ago
Planar graph routing on geographical clusters
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy rou...
Hannes Frey, Daniel Görgen
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
13 years 8 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie
IBPRIA
2007
Springer
14 years 2 months ago
A Simple But Effective Approach to Speaker Tracking in Broadcast News
The automatic transcription of broadcast news and meetings involves the segmentation, identification and tracking of speaker turns during each session, which is known as speaker di...
Luis Javier Rodríguez, Mikel Peñagar...
IJRA
2011
101views more  IJRA 2011»
13 years 5 months ago
Information Surfing for Radiation Map Building
We develop a control scheme for a group of mobile sensors to map radiation over a given planar polygonal region. The advantage of this methodology is that it provides quick situat...
R. Andres Cortez, Herbert G. Tanner, Ron Lumia, Ch...