Sciweavers

3897 search results - page 127 / 780
» complexity 2010
Sort
View
JMLR
2010
118views more  JMLR 2010»
14 years 9 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
ENTCS
2010
122views more  ENTCS 2010»
15 years 2 months ago
Composition of Services with Constraints
Abstract. Web services composition is the interleaving of action sequences executed by elementary components in accordance with a client specification. We consider Web services as ...
Philippe Balbiani, Fahima Cheikh Alili, Pierre-Cyr...
TOG
2010
97views more  TOG 2010»
14 years 9 months ago
A practical simulation of dispersed bubble flow
In this paper, we propose a simple and efficient framework for simulating dispersed bubble flow. Instead of modeling the complex hydrodynamics of numerous small bubbles explicitly...
Doyub Kim, Oh-Young Song, Hyeong-Seok Ko
ECCC
2002
74views more  ECCC 2002»
15 years 2 months ago
On the proper learning of axis parallel concepts
We study the proper learnability of axis-parallel concept classes in the PAC-learning and exactlearning models. These classes include union of boxes, DNF, decision trees and multi...
Nader H. Bshouty, Lynn Burroughs
CCCG
2010
15 years 4 months ago
Computing the straight skeleton of a monotone polygon in O(n log n) time
The straight skeleton of a simple polygon is defined as the trace of the vertices when the initial polygon is shrunken in self-parallel manner [2]. In this paper, we propose a sim...
Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy...