Sciweavers

2252 search results - page 128 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
125
Voted
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
16 years 22 days ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...
ICASSP
2008
IEEE
15 years 9 months ago
Iterative extrapolation algorithm for data reconstruction over sphere
Given limited or incomplete measurement data on a sphere, a new iterative algorithm is proposed on how to extrapolate signal over the whole sphere. The algorithm is based on a pri...
Wen Zhang, Rodney A. Kennedy, Thushara D. Abhayapa...
CADE
1999
Springer
15 years 7 months ago
A PSpace Algorithm for Graded Modal Logic
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
Stephan Tobies
CJ
2010
128views more  CJ 2010»
15 years 3 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...
EOR
2008
91views more  EOR 2008»
15 years 3 months ago
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
Giovanni Righini