493 search results - page 60 / 99 » Quantum Query Complexity of Some Graph Problems |
ICCSA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
SEBD
2007
14 years 11 months ago
2007
Preference queries aim to retrieve from large databases those objects that better match user’s requirements. Approaches proposed so far in the DB field for specifying preference...
ISPD
2010
ACM
15 years 4 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
CBMS
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper focuses on the problem of representing, in a meaningful way, the knowledge involved in the HealthAgents project. Our work is motivated by the complexity of representing...