3875 search results - page 650 / 775 » Approximation algorithms for the 0-extension problem |
181
click to vote
SMA
2009
ACM
15 years 11 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
146
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
—Since the provision of both unicast and multicast services is expected for the next generation of multi-carrier wireless systems, the allocation of resources for this combinatio...
114
click to vote
ACCV
2006
Springer
15 years 10 months ago
2006
Springer
Construction of key poses is one of the most tedious and time consuming steps in synthesizing of 3D virtual actors. Recent alternate schemes expect the user to specify two inputs. ...
129
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
126
click to vote
WABI
2005
Springer
15 years 10 months ago
2005
Springer
d Abstract] Tamir Tuller , Efrat Oron , Erez Makavy , Daniel A. Chamovitz † , and Benny Chor ‡ Tel-Aviv University, Tel-Aviv 69978, Israel. Abstract. We study gene expression d...