3875 search results - page 631 / 775 » Approximation algorithms for the 0-extension problem |
157
click to vote
ACSD
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper proposes a new approach for the hazard checking of timed asynchronous circuits. Previous papers proposed either exact algorithms, which suffer from statespace explosion...
151
Voted
SRDS
2006
IEEE
15 years 11 months ago
2006
IEEE
We consider the problem of ensuring high data availability in federated content sharing systems. Ideally, such a system would provide high data availability in a device transparen...
159
click to vote
IMR
2004
Springer
15 years 11 months ago
2004
Springer
Sweep method is one of the most robust techniques to generate hexahedral meshes in extrusion volumes. One of the main issues to be dealt by any sweep algorithm is the projection o...
145
click to vote
COMPGEOM
1998
ACM
15 years 9 months ago
1998
ACM
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
175
click to vote
BMVC
2002
15 years 8 months ago
2002
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...