1772 search results - page 121 / 355 » Classifying Problems into Complexity Classes |
273
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
214
click to vote
SIGMOD
2000
ACM
15 years 10 months ago
2000
ACM
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (po...
152
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionali...
146
click to vote
LPNMR
2009
Springer
16 years 29 days ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
220
click to vote
INFOCOM
2007
IEEE
16 years 21 days ago
2007
IEEE
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...