Sciweavers

1632 search results - page 138 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
SODA
1998
ACM
98views Algorithms» more  SODA 1998»
15 years 5 months ago
Finger Search Trees with Constant Insertion Time
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
Gerth Stølting Brodal
DATE
2005
IEEE
112views Hardware» more  DATE 2005»
15 years 9 months ago
TDMA Time Slot and Turn Optimization with Evolutionary Search Techniques
In this paper we present arithmetic real-coded variation operators tailored for time slot and turn optimization on TDMA-scheduled resources with evolutionary algorithms. Our opera...
Arne Hamann, Rolf Ernst
ICDE
2010
IEEE
203views Database» more  ICDE 2010»
15 years 8 months ago
Optimizing ETL workflows for fault-tolerance
Extract-Transform-Load (ETL) processes play an important role in data warehousing. Typically, design work on ETL has focused on performance as the sole metric to make sure that the...
Alkis Simitsis, Kevin Wilkinson, Umeshwar Dayal, M...
139
Voted
CGF
1999
86views more  CGF 1999»
15 years 3 months ago
Generalized View-Dependent Simplification
We propose a technique for performing view-dependent geometry and topology simplifications for level-of-detailbased renderings of large models. The algorithm proceeds by preproces...
Jihad El-Sana, Amitabh Varshney
ICALP
2005
Springer
15 years 9 months ago
Optimal In-place Sorting of Vectors and Records
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
Gianni Franceschini, Roberto Grossi