Sciweavers

7742 search results - page 101 / 1549
» The Robustness of Level Sets
Sort
View
72
Voted
GD
2009
Springer
15 years 5 months ago
On the Characterization of Level Planar Trees by Minimal Patterns
We consider characterizations of level planar trees. Healy et al. [8] characterized the set of trees that are level planar in terms of two minimal level non-planar (MLNP) patterns....
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
COCO
1991
Springer
173views Algorithms» more  COCO 1991»
15 years 4 months ago
On the Random-Self-Reducibility of Complete Sets
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
Joan Feigenbaum, Lance Fortnow
PRL
2006
77views more  PRL 2006»
15 years 20 days ago
Wavelet based approach to cluster analysis. Application on low dimensional data sets
In this paper, we present a wavelet based approach which tries to automatically find the number of clusters present in a data set, along with their position and statistical proper...
Xavier Otazu, Oriol Pujol
JELIA
2004
Springer
15 years 6 months ago
On the Relation Between ID-Logic and Answer Set Programming
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...
Maarten Mariën, David Gilis, Marc Denecker
92
Voted
ISCAPDCS
2003
15 years 2 months ago
On the Scalable Computation of Large Sets of Integrals
We consider efficient strategies for the parallel and distributed computation of large sets of multivariate integrals. These arise in many applications such as computational chem...
Elise de Doncker, Ajay K. Gupta, Laurentiu Cucos