Sciweavers

1430 search results - page 264 / 286
» Representing Probability Measures using Probabilistic Proces...
Sort
View
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 8 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
SSPR
2004
Springer
14 years 1 months ago
Optimizing Classification Ensembles via a Genetic Algorithm for a Web-Based Educational System
Classification fusion combines multiple classifications of data into a single classification solution of greater accuracy. Feature extraction aims to reduce the computational cost ...
Behrouz Minaei-Bidgoli, Gerd Kortemeyer, William F...
3DPVT
2006
IEEE
295views Visualization» more  3DPVT 2006»
13 years 9 months ago
Efficient Sparse 3D Reconstruction by Space Sweeping
This paper introduces a feature based method for the fast generation of sparse 3D point clouds from multiple images with known pose. We extract sub-pixel edge elements (2D positio...
Joachim Bauer, Christopher Zach, Horst Bischof
SEMWEB
2007
Springer
14 years 1 months ago
Analyzing Mapping Extraction Approaches
While lots of research in ontology matching is related to the issue of computing and refining similarity measures, only little attention has been paid to question how to extract t...
Christian Meilicke, Heiner Stuckenschmidt
ICALP
2001
Springer
14 years 5 days ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan