Sciweavers

85 search results - page 17 / 17
» Reasoning about Optimal Collections of Solutions
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
A Queueing Model Framework of PCE-Based Inter-Area Path Computation
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
Juanjuan Yu, Yue He, Kai Wu, Marco Tacca, Andrea F...
UAI
1997
13 years 8 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
MM
2003
ACM
133views Multimedia» more  MM 2003»
14 years 21 days ago
Geographic location tags on digital images
We describe an end-to-end system that capitalizes on geographic location tags for digital photographs. The World Wide Media eXchange (WWMX) database indexes large collections of i...
Kentaro Toyama, Ron Logan, Asta Roseway
BMCBI
2010
118views more  BMCBI 2010»
13 years 7 months ago
Computing H/D-Exchange rates of single residues from data of proteolytic fragments
Background: Protein conformation and protein/protein interaction can be elucidated by solution-phase Hydrogen/ Deuterium exchange (sHDX) coupled to high-resolution mass analysis o...
Ernst Althaus, Stefan Canzar, Carsten Ehrler, Mark...
CISS
2008
IEEE
14 years 1 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...