370 search results - page 37 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
125
click to vote
DASFAA
2010
IEEE
15 years 7 months ago
2010
IEEE
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
106
click to vote
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
133
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
121
click to vote
CVPR
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
117
click to vote
STACS
2009
Springer
15 years 8 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...