Sciweavers

2084 search results - page 297 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
CVPR
2010
IEEE
14 years 10 months ago
Fast directional chamfer matching
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
Ming-Yu Liu, Oncel Tuzel, Ashok Veeraraghavan, Ram...
GLOBECOM
2007
IEEE
15 years 4 months ago
A Proactive Network Coding Strategy for Pervasive Wireless Networking
— In recent years, network coding has proved to be an efficient tool to disseminate data through a network. A number of practical schemes have been proposed to implement network...
Elena Fasolo, Michele Rossi, Jörg Widmer, Mic...
WIOPT
2011
IEEE
14 years 1 months ago
Broadcasting with a battery limited energy harvesting rechargeable transmitter
—We consider the minimization of the transmission completion time with a battery limited energy harvesting transmitter in a two-user AWGN broadcast channel. The transmitter has ...
Omur Ozel, Jing Yang, Sennur Ulukus
BMCBI
2007
109views more  BMCBI 2007»
14 years 10 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....
CISS
2008
IEEE
15 years 4 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman