3172 search results - page 326 / 635 » On the Random-Self-Reducibility of Complete Sets |
233
click to vote
SEMWEB
2009
Springer
16 years 3 days ago
2009
Springer
Scalable query answering over Description Logic (DL) based ontologies plays an important role for the success of the Semantic Web. Towards tackling the scalability problem, we prop...
159
Voted
SIGGRAPH
2010
ACM
16 years 1 days ago
2010
ACM
This paper introduces a data-driven process for designing and fabricating materials with desired deformation behavior. Our process starts with measuring deformation properties of ...
188
Voted
IEAAIE
2001
Springer
16 years 18 hour ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
199
click to vote
INAP
2001
Springer
16 years 17 hour ago
2001
Springer
This paper presents new techniques for focusing the discoveryof frequent itemsets within large, dense datasets containing highly frequent items. The existence of highly frequent i...
210
Voted
DSN
2000
IEEE
15 years 12 months ago
2000
IEEE
Although Microsoft Windows is being deployed in mission-critical applications, little quantitative data has been published about its robustness. We present the results of executin...