Sciweavers

2252 search results - page 125 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
PVLDB
2008
201views more  PVLDB 2008»
15 years 2 months ago
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints
There has been considerable interest in similarity join in the research community recently. Similarity join is a fundamental operation in many application areas, such as data inte...
Chuan Xiao, Wei Wang 0011, Xuemin Lin
ICTCS
2005
Springer
15 years 8 months ago
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
Tsvi Kopelowitz, Ely Porat
119
Voted
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
15 years 9 months ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
133
Voted
FOSSACS
2007
Springer
15 years 9 months ago
PDL with Intersection and Converse Is 2 EXP-Complete
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
Stefan Göller, Markus Lohrey, Carsten Lutz
96
Voted
CCGRID
2005
IEEE
15 years 9 months ago
A dynamically adaptive hybrid algorithm for scheduling lightpaths in lambda-grids
This paper focuses on the scheduling of multiple-wavelength lightpaths and outlines an algorithm to provide increased simultaneous allocations of lightpaths on the Lambda-Grid. Se...
Neena R. Kaushik, Silvia M. Figueira