Sciweavers

3466 search results - page 584 / 694
» Fast computation of special resultants
Sort
View
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 5 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
90
Voted
NIXDORF
1992
116views Hardware» more  NIXDORF 1992»
15 years 5 months ago
Programmable Active Memories: A Performance Assessment
We present some quantitative performance measurements for the computing power of Programmable Active Memories (PAM), as introduced by [2]. Based on Field Programmable Gate Array (...
Patrice Bertin, Didier Roncin, Jean Vuillemin
187
Voted
SIGIR
1992
ACM
15 years 5 months ago
Bead: Explorations in Information Visualization
ct We describe work on the visualization of bibliographic data and, to aid in this task, the application of numerical techniques for multidimensional scaling. Many areas of scienti...
Matthew Chalmers, Paul Chitson
127
Voted
ICS
2010
Tsinghua U.
15 years 3 months 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...
135
Voted
ISMB
1994
15 years 2 months ago
High Speed Pattern Matching in Genetic Data Base with Reconfigurable Hardware
Homologydetection in large data bases is probably the most time consuming operation in molecular genetic computing systems. Moreover, the progresses made all around the world conc...
Eric Lemoine, Joël Quinqueton, Jean Sallantin