Sciweavers

2489 search results - page 444 / 498
» On the Subgroup Distance Problem
Sort
View
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 5 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
15 years 1 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
NIPS
1997
15 years 1 months ago
Computing with Action Potentials
Most computational engineering based loosely on biology uses continuous variables to represent neural activity. Yet most neurons communicate with action potentials. The engineerin...
John J. Hopfield, Carlos D. Brody, Sam T. Roweis
NIPS
1996
15 years 1 months ago
Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems
In cellular telephone systems, an important problem is to dynamically allocate the communication resource channels so as to maximize service in a stochastic caller environment. Th...
Satinder P. Singh, Dimitri P. Bertsekas
CVPR
2010
IEEE
15 years 1 days ago
Illumination compensation based change detection using order consistency
We present a change detection method resistant to global and local illumination variations for use in visual surveillance scenarios. Approaches designed thus far for robustness to...
Vasu Parameswaran, Maneesh Singh, Visvanathan Rame...