Sciweavers

234 search results - page 38 / 47
» On the relative complexity of approximate counting problems
Sort
View
NIPS
2008
13 years 9 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr
ADT
2008
13 years 7 months ago
Analytical investigation of intersection based range-free localization
By range-free localization, the positions of a mobile device can be limited to the coverage area of a radio access network cell. The drawback of such approach is the coarseness of ...
Michel Sortais, Sven D. Hermann, Adam Wolisz
MP
2006
101views more  MP 2006»
13 years 7 months ago
Robust optimization of contaminant sensor placement for community water systems
We present a series of related robust optimization models for placing sensors in municipal water networks to detect contaminants that are maliciously or accidentally injected. We f...
Robert D. Carr, Harvey J. Greenberg, William E. Ha...
IVC
2007
102views more  IVC 2007»
13 years 7 months ago
Analysis of the rubberband algorithm
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
COLT
2010
Springer
13 years 5 months ago
Forest Density Estimation
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
Anupam Gupta, John D. Lafferty, Han Liu, Larry A. ...