Sciweavers

371 search results - page 62 / 75
» Algorithms for phylogenetic footprinting
Sort
View
DMSN
2009
ACM
14 years 2 months ago
FSort: external sorting on flash-based sensor devices
In long-term deployments of Wireless Sensor Networks, it is often more efficient to store sensor readings locally at each device and transmit those readings to the user only when ...
Panayiotis Andreou, Orestis Spanos, Demetrios Zein...
VISUALIZATION
2000
IEEE
14 years 24 days ago
On-the-Fly rendering of losslessly compressed irregular volume data
Very large irregular-grid data sets are represented as tetrahedral meshes and may incur significant disk I/O access overhead in the rendering process. An effective way to allevia...
Chuan-Kai Yang, Tulika Mitra, Tzi-cker Chiueh
BMCBI
2007
138views more  BMCBI 2007»
13 years 8 months ago
Fast computation of distance estimators
Background: Some distance methods are among the most commonly used methods for reconstructing phylogenetic trees from sequence data. The input to a distance method is a distance m...
Isaac Elias, Jens Lagergren
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 9 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
ICPP
2007
IEEE
14 years 2 months ago
Integrating Memory Compression and Decompression with Coherence Protocols in Distributed Shared Memory Multiprocessors
Ever-increasing memory footprint of applications and increasing mainstream popularity of shared memory parallel computing motivate us to explore memory compression potential in di...
Lakshmana Rao Vittanala, Mainak Chaudhuri