Sciweavers

8294 search results - page 1459 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
126
Voted
EKAW
2006
Springer
15 years 7 months ago
Matching Unstructured Vocabularies Using a Background Ontology
Existing ontology matching algorithms use a combination of lexical and structural correspondance between source and target ontologies. We present a realistic case-study where both ...
Zharko Aleksovski, Michel C. A. Klein, Warner ten ...
131
Voted
EUROSYS
2008
ACM
15 years 5 months ago
Efficient guaranteed disk request scheduling with fahrrad
Guaranteed I/O performance is needed for a variety of applications ranging from real-time data collection to desktop multimedia to large-scale scientific simulations. Reservations...
Anna Povzner, Tim Kaldewey, Scott A. Brandt, Richa...
107
Voted
SIGMETRICS
2008
ACM
106views Hardware» more  SIGMETRICS 2008»
15 years 3 months ago
Performance bounds for peer-assisted live streaming
Peer-assisted streaming is a promising way for service providers to offer high-quality IPTV to consumers at reasonable cost. In peerassisted streaming, the peers exchange video ch...
Shao Liu, Rui Zhang-Shen, Wenjie Jiang, Jennifer R...
127
Voted
IJPRAI
2002
93views more  IJPRAI 2002»
15 years 3 months ago
Improving Stability of Decision Trees
Decision-tree algorithms are known to be unstable: small variations in the training set can result in different trees and different predictions for the same validation examples. B...
Mark Last, Oded Maimon, Einat Minkov
169
Voted
ICDAR
2011
IEEE
14 years 3 months ago
Graph Clustering-Based Ensemble Method for Handwritten Text Line Segmentation
—Handwritten text line segmentation on real-world data presents significant challenges that cannot be overcome by any single technique. Given the diversity of approaches and the...
Vasant Manohar, Shiv Naga Prasad Vitaladevuni, Hua...
« Prev « First page 1459 / 1659 Last » Next »