2498 search results - page 132 / 500 » Data Structures with Unpredictable Timing |
SIBGRAPI
2006
IEEE
15 years 4 months ago
2006
IEEE
This work describes a new framework for automatic extraction of 2D branching structures images obtained from 3D shapes, such as neurons and retinopathy images. The majority of met...
101
click to vote
BMCBI
2008
14 years 10 months ago
2008
Background: For many types of analyses, data about gene structure and locations of non-coding regions of genes are required. Although a vast amount of genomic sequence data is ava...
BMCBI
2005
14 years 10 months ago
2005
Background: Public databases now contain multitude of complete bacterial genomes, including several genomes of the same species. The available data offers new opportunities to add...
165
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
Data cube computation and representation are prohibitively expensive in terms of time and space. Prior work has focused on either reducing the computation time or condensing the r...
122
click to vote
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...