Sciweavers

1503 search results - page 142 / 301
» Self-optimizing distributed trees
Sort
View
HPCC
2005
Springer
15 years 8 months ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold
125
Voted
ICPR
2004
IEEE
16 years 3 months ago
Multiresolution Spatial Partitioning for Shape Representation
In this paper, an original solution for shape representation is proposed which relies on a spatial partitioning approach. The representation selects a discrete set of reference po...
Stefano Berretti, Alberto Del Bimbo
IPPS
1998
IEEE
15 years 6 months ago
Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
Anders Dessmark, Carsten Dorgerloh, Andrzej Lingas...
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
15 years 6 months ago
Towards an Analysis of Local Optimization Algorithms
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
Tassos Dimitriou, Russell Impagliazzo
ICASSP
2011
IEEE
14 years 6 months ago
Lexical access experiments with context-dependent articulatory feature-based models
We address the problem of pronunciation variation in conversational speech with a context-dependent articulatory featurebased model. The model is an extension of previous work usi...
Preethi Jyothi, Karen Livescu, Eric Fosler-Lussier