493 search results - page 93 / 99 » Quantum Query Complexity of Some Graph Problems |
GD
2005
Springer
15 years 3 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
APPROX
2011
Springer
13 years 9 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
112
click to vote
ICTAI
2009
IEEE
14 years 7 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
EDBT
2010
ACM
15 years 4 months ago
2010
ACM
A recurring manual task in data integration, ontology alignment or model management is finding mappings between complex meta data structures. In order to reduce the manual effor...
79
Voted
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Greek is one of the most difficult languages to handle in Web Information Retrieval (IR) related tasks. Its difficulty stems from the fact that it is grammatically, morphologicall...