Sciweavers

216 search results - page 15 / 44
» Edge Search Number of Cographs in Linear Time
Sort
View
POPL
1996
ACM
13 years 11 months ago
A Provably Time-Efficient Parallel Implementation of Full Speculation
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
John Greiner, Guy E. Blelloch
AMDO
2010
Springer
13 years 5 months ago
Finding Optimal Parameter Configuration for a Dynamic Triangle Mesh Compressor
This paper proposes a method of rate-distortion optimisation of an algorithm for compressing dynamic 3D triangle meshes. Although many articles regarding compression methods for th...
Oldrich Petrík, Libor Vása
IPL
2006
115views more  IPL 2006»
13 years 7 months ago
Approximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
Amitabha Bagchi, Ankur Bhargava, Torsten Suel
DBA
2006
236views Database» more  DBA 2006»
13 years 9 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...
BCB
2010
166views Bioinformatics» more  BCB 2010»
13 years 2 months ago
Fast graph approaches to measure influenza transmission across geographically distributed host types
Recent advances in next generation sequencing are providing a number of large whole-genome sequence datasets stemming from globally distributed disease occurrences. This offers an...
Adrienne Breland, Karen Schlauch, Mehmet Hadi Gune...