Sciweavers

3267 search results - page 601 / 654
» Generalized quasirandom graphs
Sort
View
BMCBI
2010
214views more  BMCBI 2010»
15 years 4 months ago
AutoSOME: a clustering method for identifying gene expression modules without prior knowledge of cluster number
Background: Clustering the information content of large high-dimensional gene expression datasets has widespread application in "omics" biology. Unfortunately, the under...
Aaron M. Newman, James B. Cooper
CVGIP
2007
99views more  CVGIP 2007»
15 years 4 months ago
Meshless geometric subdivision
Point-based surface processing has developed into an attractive alternative to mesh-based processing techniques for a number of geometric modeling applications. By working with po...
Carsten Moenning, Facundo Mémoli, Guillermo...
JACM
2000
131views more  JACM 2000»
15 years 3 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
ACTAC
1998
71views more  ACTAC 1998»
15 years 3 months ago
On the Information Content of Semi-Structured Databases
In a semi-structured database there is no clear separation between the data and the schema, and the degree to which it is structured depends on the application. Semi-structured da...
Mark Levene
SIAMDM
1998
89views more  SIAMDM 1998»
15 years 3 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky