194 search results - page 31 / 39 » Computing Roundness is Easy if the Set is Almost Round |
ANCS
2005
ACM
14 years 1 months ago
2005
ACM
Task to resource mapping problems are encountered during (i) hardware-software co-design and (ii) performance optimization of Network Processor systems. The goal of the first pro...
CPE
1998
Springer
13 years 11 months ago
1998
Springer
We consider a distributed server system model and ask which policy should be used for assigning tasks to hosts. In our model each host processes tasks in First-Come-First-Serve ord...
CRYPTO
2001
Springer
14 years 1 days ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Control of large distributed cloud-based services is a challenging problem. The Distributed Rate Limiting (DRL) paradigm was recently proposed as a mechanism for tackling this pro...
CVPR
2001
IEEE
14 years 9 months ago
2001
IEEE
This paper explores a view-based approach to recognize free-form objects in range images. We are using a set of local features that are easy to calculate and robust to partial occ...