1274 search results - page 182 / 255 » The Geometry of Coin-Weighing Problems |
184
click to vote
CAAN
2007
Springer
15 years 10 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
161
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
171
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
155
click to vote
3DPVT
2004
IEEE
15 years 10 months ago
2004
IEEE
Helmholtz Stereopsis (HS) has recently been explored as a promising technique for capturing shape of objects with unknown reflectance. So far, it has been widely applied to object...
163
click to vote
CAAN
2006
Springer
15 years 10 months ago
2006
Springer
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...