536 search results - page 50 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
111
click to vote
VLDB
1991
ACM
15 years 5 months ago
1991
ACM
A model capturing the data manipulation capabilities of a large class of methods in ohjectoriented databases is proposed and investsigated. The model uses a deterministic, paralle...
117
click to vote
NIPS
2007
15 years 3 months ago
2007
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
127
click to vote
RTCSA
2009
IEEE
15 years 8 months ago
2009
IEEE
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
111
click to vote
FOCS
1995
IEEE
15 years 5 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
115
click to vote
WDAG
2010
Springer
15 years 10 days ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...