7930 search results - page 1386 / 1586 » Greedy in Approximation Algorithms |
139
click to vote
WWW
2010
ACM
15 years 11 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
122
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
Abstract—We introduce schema covering, the problem of identifying easily understandable common objects for describing large and complex schemas. Defining transformations between...
131
click to vote
WWW
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...
226
click to vote
AVSS
2009
IEEE
15 years 11 months ago
2009
IEEE
This paper presents a background segmentation technique, which is able to process acceptable segmentation masks under fast global illumination changes. The histogram of the frame-...
155
click to vote
CP
2009
Springer
15 years 11 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...