Sciweavers

631 search results - page 18 / 127
» Additive Approximation for Edge-Deletion Problems
Sort
View
125
Voted
ICASSP
2010
IEEE
15 years 2 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
PCM
2004
Springer
168views Multimedia» more  PCM 2004»
15 years 7 months ago
Approximating Inference on Complex Motion Models Using Multi-model Particle Filter
Abstract. Due to its great ability of conquering clutters, which is especially useful for high-dimensional tracking problems, particle filter becomes popular in the visual trackin...
Jianyu Wang, Debin Zhao, Shiguang Shan, Wen Gao
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
15 years 3 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
WABI
2010
Springer
124views Bioinformatics» more  WABI 2010»
15 years 7 days ago
Improved Orientations of Physical Networks
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
Iftah Gamzu, Danny Segev, Roded Sharan
ATAL
2010
Springer
14 years 9 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...