Sciweavers

2570 search results - page 432 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 2 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
ICS
2010
Tsinghua U.
15 years 12 days ago
Clustering performance data efficiently at massive scales
Existing supercomputers have hundreds of thousands of processor cores, and future systems may have hundreds of millions. Developers need detailed performance measurements to tune ...
Todd Gamblin, Bronis R. de Supinski, Martin Schulz...
KDD
2001
ACM
145views Data Mining» more  KDD 2001»
15 years 10 months ago
Proximal support vector machine classifiers
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
Glenn Fung, Olvi L. Mangasarian
ARITH
2009
IEEE
15 years 4 months ago
A Dual-Purpose Real/Complex Logarithmic Number System ALU
—The real Logarithmic Number System (LNS) allows fast and inexpensive multiplication and division but more expensive addition and subtraction as precision increases. Recent advan...
Mark G. Arnold, Sylvain Collange
MM
2004
ACM
136views Multimedia» more  MM 2004»
15 years 3 months ago
Fingerprinting and forensic analysis of multimedia
One of the prime reasons movie and music studios have ignored the Internet for open-networked multimedia content delivery, has been the lack of a technology that can support a sec...
Daniel Schonberg, Darko Kirovski