Sciweavers

653 search results - page 20 / 131
» The size of minimum 3-trees
Sort
View
ASPDAC
2006
ACM
115views Hardware» more  ASPDAC 2006»
15 years 3 months ago
Hardware implementation of super minimum all digital FM demodulator
– We propose improvement of the new architecture of digital FM demodulator. This work enhances signal quality, system clock frequency, and superior than well known PLL technique ...
Nursani Rahmatullah, Arif E. Nugroho
SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
14 years 11 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
64
Voted
DAM
2006
88views more  DAM 2006»
14 years 9 months ago
Domination analysis for minimum multiprocessor scheduling
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
Gregory Gutin, Tommy R. Jensen, Anders Yeo
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
14 years 9 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
78
Voted
TPDS
1998
92views more  TPDS 1998»
14 years 9 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu