176 search results - page 20 / 36 » Unbalanced Points and Vertices Problem |
151
click to vote
CATS
2007
15 years 5 months ago
2007
For two points p and q in the plane, a straight line h, called a highway, and a real v > 1, we define the travel time (also known as the city distance) from p and q to be the ...
157
click to vote
MDM
2009
Springer
15 years 11 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
163
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
109
click to vote
CCCG
2007
15 years 5 months ago
2007
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...
324
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. We assume that each data poi...