Sciweavers

2412 search results - page 201 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
107
Voted
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
16 years 1 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
HYBRID
2001
Springer
15 years 8 months ago
Accurate Event Detection for Simulating Hybrid Systems
It has been observed that there are a variety of situations in which the most popular hybrid simulation methods can fail to properly detect the occurrence of discrete events. In th...
Joel M. Esposito, Vijay Kumar, George J. Pappas
SIGMETRICS
2008
ACM
138views Hardware» more  SIGMETRICS 2008»
15 years 3 months ago
Utility maximization in peer-to-peer systems
In this paper, we study the problem of utility maximization in P2P systems, in which aggregate application-specific utilities are maximized by running distributed algorithms on P2...
Minghua Chen, Miroslav Ponec, Sudipta Sengupta, Ji...
HIPS
1998
IEEE
15 years 8 months ago
Constructive and Adaptable Distributed Shared Memory
Distributed shared memory (DSM) is a paradigm for programming distributed systems, which provides an alternative to the message passing model. DSM offers the agents of the system ...
Jordi Bataller, José M. Bernabéu-Aub...
124
Voted
AI
2010
Springer
15 years 8 months ago
Overlap versus Imbalance
Abstract. In this paper we give a systematic analysis of the relationship between imbalance and overlap as factors influencing classifier performance. We demonstrate that these t...
Misha Denil, Thomas P. Trappenberg