Sciweavers

1456 search results - page 59 / 292
» Improved Randomized Results for That Interval Selection Prob...
Sort
View
ESWS
2009
Springer
15 years 5 months ago
Improving Ontology Matching Using Meta-level Learning
Despite serious research efforts, automatic ontology matching still suffers from severe problems with respect to the quality of matching results. Existing matching systems trade-of...
Kai Eckert, Christian Meilicke, Heiner Stuckenschm...
ICCBR
2003
Springer
15 years 4 months ago
Index Driven Selective Sampling for CBR
In real environments it is often difficult to obtain a collection of cases for the case base that would cover all the problem solving situations. Although it is often somewhat eas...
Nirmalie Wiratunga, Susan Craw, Stewart Massie
VIS
2007
IEEE
101views Visualization» more  VIS 2007»
16 years 18 days ago
Random-Accessible Compressed Triangle Meshes
With the exponential growth in size of geometric data, it is becoming increasingly important to make effective use of multilevel caches, limited disk storage, and bandwidth. As a r...
Sung-Eui Yoon, Peter Lindstrom
CGF
1999
79views more  CGF 1999»
14 years 11 months ago
Stochastic Iteration for Non-diffuse Global Illumination
This paper presents a single-pass, view-dependent method to solve the rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly i...
László Szirmay-Kalos
STACS
2004
Springer
15 years 4 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...