Sciweavers

1949 search results - page 203 / 390
» Random graphs on surfaces
Sort
View
CSR
2011
Springer
14 years 8 months ago
The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
Dmitry Itsykson, Dmitry Sokolov
162
Voted
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 5 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
158
Voted
TMI
2010
134views more  TMI 2010»
14 years 11 months ago
Mitral Annulus Segmentation From 3D Ultrasound Using Graph Cuts
The shape of the mitral valve annulus is used in diagnostic and modeling applications, yet methods to accurately and reproducibly delineate the annulus are limited. This paper pres...
Robert Schneider, Douglas P. Perrin, Nikolay V. Va...
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
15 years 6 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
ISBI
2006
IEEE
16 years 5 months ago
A tightly coupled region-shape framework for 3D medical image segmentation
Most hybrid 3D segmentation methods either heuristically couple the respective algorithm or combine a true 3D with a 2D algorithm due to computational considerations. In this pape...
Rui Huang, Vladimir Pavlovic, Dimitris N. Metaxas