Sciweavers

5230 search results - page 274 / 1046
» Dynamic Optimality -- Almost
Sort
View
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
15 years 11 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
CASES
2006
ACM
16 years 1 months ago
Automatic performance model construction for the fast software exploration of new hardware designs
Developing an optimizing compiler for a newly proposed architecture is extremely difficult when there is only a simulator of the machine available. Designing such a compiler requ...
John Cavazos, Christophe Dubach, Felix V. Agakov, ...
ACMACE
2009
ACM
16 years 1 months ago
Funbrella: recording and replaying vibrations through an umbrella axis
We propose an umbrella-like device called Funbrella that entertains people with many types of rain by focusing on an umbrella as a user interface that connects humans and rain. Ge...
Kazuyuki Fujita, Yuichi Itoh, Ai Yoshida, Maya Oza...
IWMM
2007
Springer
130views Hardware» more  IWMM 2007»
16 years 1 months ago
Accordion arrays
In this work, we present accordion arrays, a straightforward and effective memory compression technique targeting Unicode-based character arrays. In many non-numeric Java programs...
Craig B. Zilles
IEEEPACT
2003
IEEE
16 years 16 days ago
Reactive Multi-Word Synchronization for Multiprocessors
Shared memory multiprocessor systems typically provide a set of hardware primitives in order to support synchronization. Generally, they provide single-word read-modify-write hard...
Phuong Hoai Ha, Philippas Tsigas