Sciweavers

752 search results - page 144 / 151
» Faster approximation algorithms for the minimum latency prob...
Sort
View
ICASSP
2010
IEEE
13 years 7 months ago
Distributed bearing estimation via matrix completion
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance disto...
Andrew Waters, Volkan Cevher
RSA
2008
103views more  RSA 2008»
13 years 6 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav
WACV
2008
IEEE
14 years 1 months ago
Distributed Visual Processing for a Home Visual Sensor Network
deliver objects, handle emergency, wherever he/she is inside the home. In addition, the burden of processing We address issues dealing with distributed visual power can be distribu...
Kwangsu Kim, Gérard G. Medioni
CVPR
2009
IEEE
1468views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Hardware-Efficient Belief Propagation
Belief propagation (BP) is an effective algorithm for solving energy minimization problems in computer vision. However, it requires enormous memory, bandwidth, and computation beca...
Chao-Chung Cheng, Chia-Kai Liang, Homer H. Chen, L...
RECOMB
2006
Springer
14 years 7 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...