Sciweavers

2228 search results - page 378 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
IPPS
2010
IEEE
13 years 7 months ago
Exploring parallelism in short sequence mapping using Burrows-Wheeler Transform
Next-generation high throughput sequencing instruments are capable of generating hundreds of millions of reads in a single run. Mapping those reads to a reference genome is an ext...
Doruk Bozdag, Ayat Hatem, Ümit V. Çata...
ICGI
2010
Springer
13 years 6 months ago
Learning Context Free Grammars with the Syntactic Concept Lattice
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
Alexander Clark
CSREASAM
2006
13 years 10 months ago
Integrating the Generalized-Honeycomb-Torus for Sustainable Parking Structures in the Globalizing Age
Considering disaster sensitivity especially in developing large-scale, multiple-use parking structures, we propose dual-surveillance based SCADA (supervisory control and data acqui...
Hsun-Jung Cho, Li-Yen Hsu
ADMA
2008
Springer
147views Data Mining» more  ADMA 2008»
14 years 3 months ago
Mining Supplemental Frequent Patterns
The process of resource distribution and load balance of a distributed P2P network can be described as the process of mining Supplement Frequent Patterns (SFPs) from query transact...
Yintian Liu, Yingming Liu, Tao Zeng, Kaikuo Xu, Ro...
HPDC
2008
IEEE
13 years 9 months ago
Eliminating the middleman: peer-to-peer dataflow
Efficiently executing large-scale, data-intensive workflows such as Montage must take into account the volume and pattern of communication. When orchestrating data-centric workflo...
Adam Barker, Jon B. Weissman, Jano I. van Hemert