253 search results - page 28 / 51 » Algorithms for the Approximate Common Divisor Problem |
71
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
AAIM
2005
Springer
15 years 3 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
ICDE
2010
IEEE
15 years 4 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...
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...
78
Voted
ALENEX
2010
14 years 11 months ago
2010
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...