Sciweavers

172 search results - page 29 / 35
» Approximate low-rank factorization with structured factors
Sort
View
COMPGEOM
2004
ACM
14 years 27 days ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
INFOCOM
2002
IEEE
14 years 12 days ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...
IPSN
2007
Springer
14 years 1 months ago
Exact distributed Voronoi cell computation in sensor networks
Distributed computation of Voronoi cells in sensor networks, i.e. computing the locus of points in a sensor field closest to a given sensor, is a key building block that supports...
Boulat A. Bash, Peter Desnoyers
NIPS
2007
13 years 9 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
BMCBI
2005
122views more  BMCBI 2005»
13 years 7 months ago
Quantitative analysis of EGR proteins binding to DNA: assessing additivity in both the binding site and the protein
Background: Recognition codes for protein-DNA interactions typically assume that the interacting positions contribute additively to the binding energy. While this is known to not ...
Jiajian Liu, Gary D. Stormo