811 search results - page 50 / 163 » An efficient algorithm for the configuration problem of domi... |
STOC
2003
ACM
14 years 10 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
SAC
2008
ACM
13 years 10 months ago
2008
ACM
Skyline queries are important due to their usefulness in many application domains. However, by increasing the number of attributes, the probability that a tuple dominates another ...
IWPEC
2010
Springer
13 years 8 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
CIARP
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
IJCAI
2003
13 years 11 months ago
2003
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...