7811 search results - page 1356 / 1563 » computing 2004 |
120
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
104
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
124
Voted
UAI
2004
15 years 5 months ago
2004
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
126
Voted
UAI
2004
15 years 5 months ago
2004
Humans currently use arguments for explaining choices which are already made, or for evaluating potential choices. Each potential choice has usually pros and cons of various stren...
107
Voted
UAI
2004
15 years 5 months ago
2004
For many real-life Bayesian networks, common knowledge dictates that the output established for the main variable of interest increases with higher values for the observable varia...