8294 search results - page 215 / 1659 » Presenting Data from Experiments in Algorithmics |
201
click to vote
ADC
2008
Springer
16 years 20 days ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
141
Voted
MICCAI
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper focuses on the evaluation of an ideal midsagittal plane iMSP extraction algorithm. The algorithm was developed for capturing the iMSP from 3D normal and pathol...
173
click to vote
CINQ
2004
Springer
15 years 11 months ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
156
click to vote
WOSP
1998
ACM
15 years 10 months ago
1998
ACM
Increasingly, new applications are being built by composing existing software components rather than by coding a system from scratch. Using this approach, applications can be buil...
152
Voted
NIPS
2007
15 years 7 months ago
2007
We propose an active learning algorithm that learns a continuous valuation model from discrete preferences. The algorithm automatically decides what items are best presented to an...