Sciweavers

11160 search results - page 1844 / 2232
» Incompleteness in a General Setting
Sort
View
206
Voted
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
16 years 5 days ago
Parallel community detection on large networks with propinquity dynamics
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
Yuzhou Zhang, Jianyong Wang, Yi Wang, Lizhu Zhou
204
Voted
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
16 years 2 days ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
ESOP
2001
Springer
16 years 2 days ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing
202
Voted
SIGGRAPH
2010
ACM
16 years 2 days ago
A connection between partial symmetry and inverse procedural modeling
In this paper, we address the problem of inverse procedural modeling: Given a piece of exemplar 3D geometry, we would like to find a set of rules that describe objects that are s...
Martin Bokeloh, Michael Wand, Hans-Peter Seidel
ICDT
2001
ACM
147views Database» more  ICDT 2001»
16 years 1 days ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
« Prev « First page 1844 / 2232 Last » Next »