Sciweavers

1757 search results - page 229 / 352
» Alternating Refinement Relations
Sort
View
110
Voted
DCC
2006
IEEE
16 years 3 months ago
Data Compression with Restricted Parsings
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...
John T. Robinson, Luis Alfonso Lastras-Monta&ntild...
ICCD
2008
IEEE
116views Hardware» more  ICCD 2008»
16 years 23 days ago
Prototyping a hybrid main memory using a virtual machine monitor
— We use a novel virtualization-based approach for computer architecture performance analysis. We present a case study analyzing a hypothetical hybrid main memory, which consists...
Dong Ye, Aravind Pavuluri, Carl A. Waldspurger, Br...
99
Voted
ICCD
2005
IEEE
100views Hardware» more  ICCD 2005»
16 years 22 days ago
Temporal Decomposition for Logic Optimization
Traditional approaches for sequential logic optimization include (1) explicit state-based techniques such as state minimization, (2) structural techniques such as retiming, and (3...
Nathan Kitchen, Andreas Kuehlmann
PLPV
2010
ACM
16 years 21 days ago
Modular reasoning about invariants over shared state with interposed data members
Reasoning about object-oriented programs is difficult since such programs usually involve aliasing, and it is not easy to identify the ways objects can relate to each other and t...
Stephanie Balzer, Thomas R. Gross
TEI
2009
ACM
70views Hardware» more  TEI 2009»
15 years 10 months ago
Peripheral tangible interaction by analytic design
Tangible User Interfaces (TUIs) are commonly accepted as those in which the configuration of physical objects embodies digital system state, providing “graspable” digital medi...
Darren Edge, Alan F. Blackwell