Sciweavers

4212 search results - page 289 / 843
» On Compressible Pairings and Their Computation
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
BMCBI
2007
109views more  BMCBI 2007»
15 years 6 months ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....
JMM2
2006
167views more  JMM2 2006»
15 years 6 months ago
Computer Vision Methods for Improved Mobile Robot State Estimation in Challenging Terrains
External perception based on vision plays a critical role in developing improved and robust localization algorithms, as well as gaining important information about the vehicle and ...
Annalisa Milella, Giulio Reina, Roland Siegwart
TKDE
2011
168views more  TKDE 2011»
15 years 1 months ago
On Computing Farthest Dominated Locations
—In reality, spatial objects (e.g., hotels) not only have spatial locations but also have quality attributes (e.g., price, star). An object p is said to dominate another one p , ...
Hua Lu, Man Lung Yiu
COMPGEOM
2006
ACM
16 years 22 days ago
Vines and vineyards by updating persistence in linear time
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...