Sciweavers

392 search results - page 22 / 79
» Reversal Complexity Revisited
Sort
View
CHI
2010
ACM
14 years 2 months ago
Prefab: implementing advanced behaviors using pixel-based reverse engineering of interface structure
Current chasms between applications implemented with different user interface toolkits make it difficult to implement and explore potentially important interaction techniques in n...
Morgan Dixon, James Fogarty
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
13 years 11 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams
TVLSI
2010
13 years 2 months ago
A Reverse-Encoding-Based On-Chip Bus Tracer for Efficient Circular-Buffer Utilization
Hardware debuggers and logic analyzers must be able to record a continuous trace of data. Since the trace data are tremendous, to save space, these traces are often compressed. The...
Fu-Ching Yang, Cheng-Lung Chiang, Ing-Jer Huang
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
14 years 1 months ago
Using Multi-hypothesis Mapping to close Loops in Complex Cyclic Environments
— This paper describes an off-line, iterative algorithm for simultaneous localization and mapping within large indoor environments. The proposed approach is based on the idea of ...
Haris Baltzakis, Panos E. Trahanias
EUROCRYPT
2005
Springer
14 years 1 months ago
Reducing Complexity Assumptions for Statistically-Hiding Commitment
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-...