4171 search results - page 383 / 835 » Choice numbers of graphs |
173
click to vote
PAMI
2010
15 years 5 months ago
2010
— This paper introduces the contextual dissimilarity measure which significantly improves the accuracy of bag-offeatures based image search. Our measure takes into account the l...
333
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
204
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
213
click to vote
AIPS
2010
15 years 8 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
179
click to vote
WAOA
2005
Springer
16 years 15 days ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...