6393 search results - page 430 / 1279 » Randomized Algorithms on the Mesh |
179
click to vote
CGF
2007
15 years 6 months ago
2007
We introduce an algorithm for the automatic computation of global parameterizations on arbitrary simplicial 2manifolds, whose parameter lines are guided by a given frame field, f...
228
click to vote
ESA
2011
Springer
14 years 6 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
191
click to vote
ESA
1997
Springer
15 years 11 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
198
Voted
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
—Efficient server selection algorithms reduce retrieval time for objects replicated on different servers and are an important component of Internet cache architectures. This pap...
169
click to vote
WAOA
2007
Springer
16 years 29 days ago
2007
Springer
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...