Sciweavers

322 search results - page 12 / 65
» Counting Dependence Predictors
Sort
View
COMPGEOM
2004
ACM
15 years 3 months ago
Range counting over multidimensional data streams
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
Subhash Suri, Csaba D. Tóth, Yunhong Zhou
TCS
2008
14 years 9 months ago
Generalized approximate counting revisited
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
Guy Louchard, Helmut Prodinger
CPC
2000
93views more  CPC 2000»
14 years 9 months ago
Fast Unimodular Counting
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral ve...
John Mount
86
Voted
CORR
2008
Springer
117views Education» more  CORR 2008»
14 years 9 months ago
Robust Stochastic Chemical Reaction Networks and Bounded Tau-Leaping
The behavior of some stochastic chemical reaction networks is largely unaffected by slight inaccuracies in reaction rates. We formalize the robustness of state probabilities to re...
David Soloveichik
EMNLP
2008
14 years 11 months ago
Stacking Dependency Parsers
We explore a stacked framework for learning to predict dependency structures for natural language sentences. A typical approach in graph-based dependency parsing has been to assum...
André F. T. Martins, Dipanjan Das, Noah A. ...