Sciweavers

14078 search results - page 249 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
IPL
2011
91views more  IPL 2011»
14 years 10 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
JCDL
2010
ACM
151views Education» more  JCDL 2010»
15 years 8 months ago
Domain-specific iterative readability computation
We present a new algorithm to measure domain-specific readability. It iteratively computes the readability of domainspecific resources based on the difficulty of domain-specific c...
Jin Zhao, Min-Yen Kan
CORR
2011
Springer
206views Education» more  CORR 2011»
15 years 1 months ago
Arrangement Computation for Planar Algebraic Curves
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
Eric Berberich, Pavel Emeliyanenko, Alexander Kobe...
GLVLSI
2007
IEEE
141views VLSI» more  GLVLSI 2007»
15 years 10 months ago
A synchronization algorithm for local temporal refinements in perfectly synchronous models with nested feedback loops
he abstract and simple computation and communication mechanism in the synchronous computational model it is easy to simulate synchronous systems and to apply formal verification m...
Tarvo Raudvere, Ingo Sander, Axel Jantsch
DAC
2003
ACM
16 years 7 months ago
Power grid reduction based on algebraic multigrid principles
With the scaling of technology, power grid noise is becoming increasingly significant for circuit performance. A typical power grid circuit contains millions of linear elements, m...
Haihua Su, Emrah Acar, Sani R. Nassif