Sciweavers

206 search results - page 7 / 42
» Efficient adaptive collect using randomization
Sort
View
MOBISYS
2008
ACM
14 years 8 months ago
Composcan: adaptive scanning for efficient concurrent communications and positioning with 802.11
Using 802.11 concurrently for communications and positioning is problematic, especially if location-based services (e.g., indoor navigation) are concurrently executed with real-ti...
Mikkel Baun Kjærgaard, Thomas King
CC
2008
Springer
131views System Software» more  CC 2008»
13 years 8 months ago
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
Marius Zimand
SODA
2004
ACM
80views Algorithms» more  SODA 2004»
13 years 10 months ago
Output-sensitive construction of the union of triangles
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
Eti Ezra, Micha Sharir
CGI
2006
IEEE
14 years 2 months ago
An Efficient Keyframe Extraction from Motion Capture Data
This paper proposes a keyframe extraction method based on a novel layered curve simplification algorithm for motion capture data. Bone angles are employed as motion features and ke...
Jun Xiao, Yueting Zhuang, Tao Yang, Fei Wu
TIT
2002
102views more  TIT 2002»
13 years 8 months ago
Asymptotic efficiency of two-stage disjunctive testing
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
Toby Berger, Vladimir I. Levenshtein