Sciweavers

1457 search results - page 178 / 292
» On the Uniform Distribution of Strings
Sort
View
FCT
2007
Springer
15 years 10 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...
DILS
2006
Springer
15 years 10 months ago
Data Access and Integration in the ISPIDER Proteomics Grid
Abstract. Grid computing has great potential for supporting the integration of complex, fast changing biological data repositories to enable distributed data analysis. One scenario...
Lucas Zamboulis, Hao Fan, Khalid Belhajjame, Jenni...
COCO
2008
Springer
146views Algorithms» more  COCO 2008»
15 years 8 months ago
A Direct Product Theorem for Discrepancy
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
Troy Lee, Adi Shraibman, Robert Spalek
WSC
1998
15 years 7 months ago
Communicating Structures for Modeling Large-scale Systems
ating Structures is a system abstraction that helps to model large-scale distributed systems, whose performance mostly depends on how well the data and messages traffic is organiz...
Vadim E. Kotov
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 7 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu