Sciweavers

4926 search results - page 33 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
PODS
2006
ACM
104views Database» more  PODS 2006»
14 years 7 months ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei
ICS
2010
Tsinghua U.
14 years 5 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
IDA
2002
Springer
13 years 7 months ago
Optimization of association rule mining queries
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...
Baptiste Jeudy, Jean-François Boulicaut
BMCBI
2010
189views more  BMCBI 2010»
13 years 7 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
IJCV
2010
249views more  IJCV 2010»
13 years 6 months ago
A Computational Model of Multidimensional Shape
We develop a computational model of shape that extends existing Riemannian models of shape of curves to multidimensional objects of general topological type. We construct shape sp...
Xiuwen Liu, Yonggang Shi, Ivo D. Dinov, Washington...