3133 search results - page 246 / 627 » Representing clusters for retrieval |
138
click to vote
VIS
2003
IEEE
16 years 8 months ago
2003
IEEE
We present a method to represent unstructured scalar fields at multiple levels of detail. Using a parallelizable classification algorithm to build a cluster hierarchy, we generate...
146
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
We define a cluster to be characterized by regions of high density separated by regions that are sparse. By observing the downward closure property of density, the search for inte...
154
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
In order to meet the high throughput requirements of applications exhibiting high ILP, VLIW ASIPs may increasingly include large numbers of functional unitsFUs. Unfortunately, `sw...
221
click to vote
EVOW
2010
Springer
16 years 1 months ago
2010
Springer
Overlapping genes (encoded on the same DNA strand but in different frames) are thought to be rare and, therefore, were largely neglected in the past. In a test set of 800 viruses ...
165
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real...