Sciweavers

525 search results - page 65 / 105
» Large Mesh Simplification using Processing Sequences
Sort
View
BIOCOMP
2006
13 years 10 months ago
Finishing Repetitive Regions Automatically with Dupfinisher
Currently, the genome sequencing community is producing shotgun sequence data at a very high rate, but genome finishing is not keeping pace, even with the help from several automa...
Cliff Han, Patrick Chain
SAC
2004
ACM
14 years 1 months ago
Guiding motif discovery by iterative pattern refinement
In this paper, we demonstrate that the performance of a motif discovery algorithm can be significantly improved by embedding it into a novel framework that effectively guides the ...
Zhiping Wang, Mehmet M. Dalkilic, Sun Kim
SSD
2005
Springer
153views Database» more  SSD 2005»
14 years 2 months ago
Constrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...
ICPP
1992
IEEE
14 years 17 days ago
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
Minze V. Chien, A. Yavuz Oruç
JCP
2008
145views more  JCP 2008»
13 years 8 months ago
An Effective Mining Algorithm for Weighted Association Rules in Communication Networks
The mining of weighted association rules is one of the primary methods used in communication alarm correlation analysis. With large communication alarm database, the traditional me...
Jian Wu, Xing ming Li