Sciweavers

76 search results - page 9 / 16
» Testing Polynomials over General Fields
Sort
View
COLT
2008
Springer
13 years 10 months ago
Learning Acyclic Probabilistic Circuits Using Test Paths
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
Dana Angluin, James Aspnes, Jiang Chen, David Eise...
EMMCVPR
2001
Springer
14 years 1 months ago
A Hierarchical Markov Random Field Model for Figure-Ground Segregation
To segregate overlapping objects into depth layers requires the integration of local occlusion cues distributed over the entire image into a global percept. We propose to model thi...
Stella X. Yu, Tai Sing Lee, Takeo Kanade
MIA
2010
170views more  MIA 2010»
13 years 3 months ago
Linear intensity-based image registration by Markov random fields and discrete optimization
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
Darko Zikic, Ben Glocker, Oliver Kutter, Martin Gr...
KBSE
2007
IEEE
14 years 2 months ago
Scalable automatic test data generation from modeling diagrams
We explore the automatic generation of test data that respect constraints expressed in the Object-Role Modeling (ORM) language. ORM is a popular conceptual modeling language, prim...
Yannis Smaragdakis, Christoph Csallner, Ranjith Su...
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
13 years 10 months ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris