1941 search results - page 303 / 389 » On the Hardness of Approximate Reasoning |
157
click to vote
IPSN
2010
Springer
16 years 1 months ago
2010
Springer
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
178
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
The prediction of the correct secondary structures of large RNAs is one of the unsolved challenges of computational molecular biology. Among the major obstacles is the fact that a...
160
click to vote
WSDM
2009
ACM
16 years 1 months ago
2009
ACM
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
171
click to vote
IPSN
2009
Springer
16 years 1 months ago
2009
Springer
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
188
click to vote
CIKM
2009
Springer
16 years 24 days ago
2009
Springer
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...