Sciweavers

6568 search results - page 1127 / 1314
» Reducing the Complexity of Reductions
Sort
View
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
15 years 7 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
WCE
2007
15 years 7 months ago
Acoustic-Structural Coupling of the Automobile Passenger Compartment
— Renewed interest in reducing interior noise in transportation vehicles has motivated research in low frequency, structural-acoustic analysis. The internal sound field in the en...
Mariana R. Kruntcheva
WCE
2007
15 years 7 months ago
Data Communication and Parallel Computing on Twisted Hypercubes
Massively parallel distributed-memory architectures are receiving increasing attention to meet the increasing demand on processing power. Many topologies have been proposed for int...
Emad Abuelrub
WCE
2007
15 years 7 months ago
A Dynamic Method for the Evaluation and Comparison of Imputation Techniques
— Imputation of missing data is important in many areas, such as reducing non-response bias in surveys and maintaining medical documentation. Estimating the uncertainty inherent ...
Norman Solomon, Giles Oatley, Kenneth McGarry
ATAL
2008
Springer
15 years 7 months ago
A preliminary result on a representative-based multi-round protocol for multi-issue negotiations
Multi-issue negotiation protocols represent a promising field since most negotiation problems in the real world involve multiple issues. Our work focuses on negotiation with inte...
Katsuhide Fujita, Takayuki Ito, Mark Klein
« Prev « First page 1127 / 1314 Last » Next »