905 search results - page 125 / 181 » On the Complexity of uSPR Distance |
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
105
click to vote
ISCA
2003
IEEE
15 years 3 months ago
2003
IEEE
This work examines dynamic cluster assignment for a clustered trace cache processor (CTCP). Previously proposed cluster assignment techniques run into unique problems as issue wid...
CIVR
2003
Springer
15 years 3 months ago
2003
Springer
Feature selection for video retrieval applications is impractical with existing techniques, because of their high time complexity and their failure on the relatively sparse trainin...
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
We present the result of our work on use of genetic programming for evolving social behavior of agents situated in inherently cooperative environment. We use predators-prey pursuit...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...