Sciweavers

3909 search results - page 452 / 782
» Extreme Model Checking
Sort
View
JMLR
2006
125views more  JMLR 2006»
15 years 4 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss
127
Voted
NLE
2008
140views more  NLE 2008»
15 years 4 months ago
Active learning and logarithmic opinion pools for HPSG parse selection
For complex tasks such as parse selection, the creation of labelled training sets can be extremely costly. Resource-efficient schemes for creating informative labelled material mu...
Jason Baldridge, Miles Osborne
MICS
2010
134views more  MICS 2010»
15 years 3 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
DAC
2012
ACM
13 years 7 months ago
Self-aware computing in the Angstrom processor
Addressing the challenges of extreme scale computing requires holistic design of new programming models and systems that support those models. This paper discusses the Angstrom pr...
Henry Hoffmann, Jim Holt, George Kurian, Eric Lau,...
ICCV
1998
IEEE
16 years 6 months ago
A Real-Time Algorithm for Medical Shape Recovery
In this paper, we present a shape recovery technique in 2 0 and 3 0 with specific applications in visualizing and measuring anatomical shapes from medical images. This algorithm m...
Ravi Malladi, James A. Sethian