Sciweavers

15073 search results - page 88 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
AI
2008
Springer
15 years 3 months ago
Expressive probabilistic description logics
The work in this paper is directed towards sophisticated formalisms for reasoning under probabilistic uncertainty in ontologies in the Semantic Web. Ontologies play a central role...
Thomas Lukasiewicz
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
15 years 8 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
196
Voted
CVPR
2012
IEEE
13 years 5 months ago
Random walks based multi-image segmentation: Quasiconvexity results and GPU-based solutions
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
Maxwell D. Collins, Jia Xu, Leo Grady, Vikas Singh
SAC
2005
ACM
15 years 8 months ago
Automatic wrapper maintenance for semi-structured web sources using results from previous queries
During the last years, significant attention has been paid to the problem of building wrappers for extracting data from semistructured web sources. Nevertheless, since web sources...
Juan Raposo, Alberto Pan, Manuel Álvarez, &...
CORR
2007
Springer
99views Education» more  CORR 2007»
15 years 3 months ago
Evolutionary Mesh Numbering: Preliminary Results
Abstract. Mesh numbering is a critical issue in Finite Element Methods, as the computational cost of one analysis is highly dependent on the order of the nodes of the mesh. This pa...
Francis Sourd, Marc Schoenauer