551 search results - page 41 / 111 » The Complexity of Andersen's Analysis in Practice |
DESRIST
2009
Springer
15 years 3 months ago
2009
Springer
In this paper, we describe the concept of ontological design. We show how ontologies can be used as cognitive maps of complex, ill-structured, plastic problems. They can be used t...
111
click to vote
CAL
2002
14 years 11 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
ECCV
2004
Springer
15 years 5 months ago
2004
Springer
Computer vision methods can be applied to a variety of medical and surgical applications, and many techniques and algorithms are available that can be used to recover 3D shapes and...
114
click to vote
TCS
2008
14 years 11 months ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...