Sciweavers

851 search results - page 3 / 171
» Random constructions and density results
Sort
View
JMLR
2010
145views more  JMLR 2010»
13 years 1 months ago
Parallelizable Sampling of Markov Random Fields
Markov Random Fields (MRFs) are an important class of probabilistic models which are used for density estimation, classification, denoising, and for constructing Deep Belief Netwo...
James Martens, Ilya Sutskever
ICCV
2001
IEEE
14 years 8 months ago
Robust Histogram Construction from Color Invariants
An effective object recognition scheme is to represent and match images on the basis of histograms derived from photometric color invariants. A drawback, however, is that certain c...
Theo Gevers
INFOCOM
2006
IEEE
14 years 10 days ago
Is Deterministic Deployment Worse than Random Deployment for Wireless Sensor Networks?
— Before a sensor network is deployed, it is important to determine how many sensors are required to achieve a certain coverage degree. The number of sensor required for maintain...
Honghai Zhang, Jennifer C. Hou
IPL
2006
95views more  IPL 2006»
13 years 6 months ago
Smaller superconcentrators of density 28
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality ...
Uwe Schöning
CP
2001
Springer
13 years 10 months ago
Random 3-SAT and BDDs: The Plot Thickens Further
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Alfonso San Miguel Aguirre, Moshe Y. Vardi