Sciweavers

1503 search results - page 59 / 301
» Self-optimizing distributed trees
Sort
View
IWOCA
2010
Springer
232views Algorithms» more  IWOCA 2010»
13 years 4 months ago
Computing Role Assignments of Proper Interval Graphs in Polynomial Time
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
Pinar Heggernes, Pim van 't Hof, Daniël Paulu...
ICASSP
2011
IEEE
13 years 1 months ago
Online feature selection and classification
This paper presents an online feature selection and classification algorithm. The algorithm is implemented for impact acoustics signals to sort hazelnut kernels. The classifier, w...
Habil Kalkan, Bayram Cetisli
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
12 years 9 days ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
EUROPAR
2001
Springer
14 years 2 months ago
Parallel Tree Projection Algorithm for Sequence Mining
Discovery of sequential patterns is becoming increasingly useful and essential in many scienti c and commercial domains. Enormous sizes of available datasets and possibly large nu...
Valerie Guralnik, Nivea Garg, George Karypis
ENTCS
2007
81views more  ENTCS 2007»
13 years 9 months ago
Self-assembling Trees
RCCS is a variant of Milner’s CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in t...
Vincent Danos, Jean Krivine, Fabien Tarissan