Sciweavers

1132 search results - page 154 / 227
» Structural Average Case Complexity
Sort
View
ADL
2000
Springer
251views Digital Library» more  ADL 2000»
14 years 1 months ago
Efficient Similarity Search in Digital Libraries
Digital libraries are a core information technology. When the stored data is complex, e.g. high-resolution images or molecular protein structures, simple query types like the exac...
Christian Böhm, Bernhard Braunmüller, Ha...
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
13 years 10 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers
ORL
2000
77views more  ORL 2000»
13 years 9 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
SAGT
2010
Springer
119views Game Theory» more  SAGT 2010»
13 years 7 months ago
Minimal Subsidies in Expense Sharing Games
A key solution concept in cooperative game theory is the core. The core of an expense sharing game contains stable allocations of the total cost to the participating players, such ...
Reshef Meir, Yoram Bachrach, Jeffrey S. Rosenschei...
GLOBECOM
2007
IEEE
14 years 3 months ago
Initialization Techniques for Improved Convergence of LMS DFEs in Strong Interference Environments
— The least-mean square (LMS) decision-feedback equalizer (DFE) was previously shown [1], [2] to possess an extended convergence time in an interference limited environment. In [...
Arun Batra, James R. Zeidler, Aloysius A. Beex