Sciweavers

11722 search results - page 2284 / 2345
» How Developers Develop Features
Sort
View
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 10 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
RIVF
2007
13 years 10 months ago
Stochastic routing in large grid-shaped quantum networks
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
Cuong Le Quoc, Patrick Bellot, Akim Demaille
SDM
2007
SIAM
98views Data Mining» more  SDM 2007»
13 years 10 months ago
Lattice based Clustering of Temporal Gene-Expression Matrices
Individuals show different cell classes when they are in the different stages of a disease, have different disease subtypes, or have different response to a treatment or envir...
Yang Huang, Martin Farach-Colton
ACL
2004
13 years 10 months ago
Evaluating Centering-Based Metrics of Coherence
We use a reliably annotated corpus to compare metrics of coherence based on Centering Theory with respect to their potential usefulness for text structuring in natural language ge...
Nikiforos Karamanis, Massimo Poesio, Chris Mellish...
AAAI
2006
13 years 10 months ago
Action Selection in Bayesian Reinforcement Learning
My research attempts to address on-line action selection in reinforcement learning from a Bayesian perspective. The idea is to develop more effective action selection techniques b...
Tao Wang
« Prev « First page 2284 / 2345 Last » Next »