Sciweavers

2465 search results - page 217 / 493
» Automata on Linear Orderings
Sort
View
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
14 years 3 months ago
Ranking - Methods for Flexible Evaluation and Efficient Comparison of Classification Performance
We present the notion of Ranking for evaluation of two-class classifiers. Ranking is based on using the ordering information contained in the output of a scoring model, rather tha...
Saharon Rosset
ARC
2008
Springer
115views Hardware» more  ARC 2008»
14 years 24 days ago
A High Throughput FPGA-based Floating Point Conjugate Gradient Implementation
As Field Programmable Gate Arrays (FPGAs) have reached capacities beyond millions of equivalent gates, it becomes possible to accelerate floating-point scientific computing applica...
Antonio Roldao Lopes, George A. Constantinides
DAM
2000
97views more  DAM 2000»
13 years 10 months ago
Algorithms and obstructions for linear-width and related search parameters
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
Dimitrios M. Thilikos
GD
2001
Springer
14 years 3 months ago
Fast and Simple Horizontal Coordinate Assignment
Abstract. We present a simple, linear-time algorithm to determine horizontal coordinates in layered layouts subject to a given ordering within each layer. The algorithm is easy to ...
Ulrik Brandes, Boris Köpf
SIGMOD
1998
ACM
93views Database» more  SIGMOD 1998»
14 years 3 months ago
Efficiently Mining Long Patterns from Databases
We present a pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In c...
Roberto J. Bayardo Jr.