Sciweavers

893 search results - page 162 / 179
» Descent Theory for Schemes
Sort
View
89
Voted
INFOCOM
2009
IEEE
15 years 6 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar
ATAL
2009
Springer
15 years 6 months ago
Boolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
15 years 6 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
MHCI
2009
Springer
15 years 6 months ago
Hoverflow: exploring around-device interaction with IR distance sensors
By equipping a mobile device with distance sensing capabilities, we aim to expand the interaction possibilities of mobile and wearable devices beyond the confines of the physical ...
Sven G. Kratz, Michael Rohs
RTAS
2008
IEEE
15 years 6 months ago
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
Harini Ramaprasad, Frank Mueller