Sciweavers

2127 search results - page 283 / 426
» Computing large matchings fast
Sort
View
MPC
2010
Springer
174views Mathematics» more  MPC 2010»
15 years 8 months ago
Matrices as Arrows!
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...
Hugo Daniel Macedo, José Nuno Oliveira
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 8 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
BMCBI
2008
111views more  BMCBI 2008»
15 years 4 months ago
Probabilistic base calling of Solexa sequencing data
Background: Solexa/Illumina short-read ultra-high throughput DNA sequencing technology produces millions of short tags (up to 36 bases) by parallel sequencing-by-synthesis of DNA ...
Jacques Rougemont, Arnaud Amzallag, Christian Isel...
EDBT
2006
ACM
182views Database» more  EDBT 2006»
16 years 4 months ago
On High Dimensional Skylines
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anth...
GRAPHITE
2006
ACM
15 years 10 months ago
GPU-based rendering of sparse low-degree implicit surfaces
Implicit surface is a well-known surface representation. Geometric details of an object can be represented using less surface primitives than other representations such as polygon...
Takashi Kanai, Yutaka Ohtake, Hiroaki Kawata, Kiwa...