Sciweavers

580 search results - page 47 / 116
» On the memory complexity of the forward-backward algorithm
Sort
View
COMPGEOM
2011
ACM
12 years 11 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
14 years 1 months ago
A destructive evolutionary process: a pilot implementation
This paper describes the application of evolutionary search to the problem of Flash memory wear-out. The operating parameters of Flash memory are notoriously difficult to determin...
Joe Sullivan, Conor Ryan
NETWORKING
2008
13 years 9 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Mohammad Behdadfar, Hossein Saidi
ECOOP
2005
Springer
14 years 1 months ago
Derivation and Evaluation of Concurrent Collectors
There are many algorithms for concurrent garbage collection, but they are complex to describe, verify, and implement. This has resulted in a poor understanding of the relationships...
Martin T. Vechev, David F. Bacon, Perry Cheng, Dav...
JASIS
2007
122views more  JASIS 2007»
13 years 7 months ago
Exploiting parallelism to support scalable hierarchical clustering
A distributed memory parallel version of the group average Hierarchical Agglomerative Clustering algorithm is proposed to enable scaling the document clustering problem to large c...
Rebecca Cathey, Eric C. Jensen, Steven M. Beitzel,...