6274 search results - page 616 / 1255 » From query complexity to computational complexity |
180
click to vote
KR
1989
Springer
15 years 11 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
178
click to vote
COLING
2002
15 years 7 months ago
2002
Title generation is a complex task involving both natural language understanding and natural language synthesis. In this paper, we propose a new probabilistic model for title gene...
187
click to vote
ICIP
2007
IEEE
16 years 9 months ago
2007
IEEE
An interactive algorithm for soft segmentation and matting of natural images and videos is presented in this paper. The technique follows and extends [10], where the user first ro...
227
click to vote
MIDDLEWARE
2004
Springer
16 years 17 days ago
2004
Springer
Application servers provide many functionalities commonly needed in the development of a complex distributed application. So far, the functionalities have mostly been developed an...
181
click to vote
PODS
2010
ACM
16 years 8 days ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...