2168 search results - page 424 / 434 » Randomized Algorithms and Complexity Theory |
IROS
2007
IEEE
15 years 5 months ago
2007
IEEE
Abstract— We present the Binocular Sparse Feature Segmentation (BSFS) algorithm for vision-based person following with a mobile robot. BSFS uses Lucas-Kanade feature detection an...
118
click to vote
TELETRAFFIC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Renewed interest in ALOHA-based Medium Access Control (MAC) protocols stems from their proposed applications to wireless ad hoc and sensor networks that require distribut...
104
click to vote
ICPP
2006
IEEE
15 years 5 months ago
2006
IEEE
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
103
click to vote
SIGCOMM
2006
ACM
15 years 5 months ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
106
click to vote
EUROCRYPT
2004
Springer
15 years 5 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...