Sciweavers

17770 search results - page 264 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
15 years 8 months ago
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
Barna Saha, Pabitra Mitra
SCHEDULING
2010
116views more  SCHEDULING 2010»
15 years 5 months ago
Characterizing sets of jobs that admit optimal greedy-like algorithms
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
Periklis A. Papakonstantinou, Charles Rackoff
STOC
2005
ACM
158views Algorithms» more  STOC 2005»
16 years 7 months ago
Polynomial time quantum algorithm for the computation of the unit group of a number field
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
Arthur Schmidt, Ulrich Vollmer
BIBM
2007
IEEE
149views Bioinformatics» more  BIBM 2007»
15 years 11 months ago
An Algorithm for Assigning Unique Keys to Metabolic Pathways
Different databases of metabolic pathways assign pathways different keys. For this reason, it is difficult to automatically compare pathways across databases. We introduce an algo...
Fang Fang, Robert L. Grossman, Xiangjun Liu
ICALP
2000
Springer
15 years 10 months ago
Average Bit-Complexity of Euclidean Algorithms
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
Ali Akhavi, Brigitte Vallée