Sciweavers

837 search results - page 147 / 168
» Hard combinators
Sort
View
NSDI
2008
15 years 14 days ago
BFT Protocols Under Fire
Much recent work on Byzantine state machine replication focuses on protocols with improved performance under benign conditions (LANs, homogeneous replicas, limited crash faults), ...
Atul Singh, Tathagata Das, Petros Maniatis, Peter ...
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 5 days ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
ASPLOS
2008
ACM
15 years 4 days ago
Tapping into the fountain of CPUs: on operating system support for programmable devices
The constant race for faster and more powerful CPUs is drawing to a close. No longer is it feasible to significantly increase the speed of the CPU without paying a crushing penalt...
Yaron Weinsberg, Danny Dolev, Tal Anker, Muli Ben-...
ICSE
2010
IEEE-ACM
15 years 4 days ago
Supporting developers with natural language queries
The feature list of modern IDEs is steadily growing and mastering these tools becomes more and more demanding, especially for novice programmers. Despite their remarkable capabili...
Michael Würsch, Giacomo Ghezzi, Gerald Reif, ...
CCS
2008
ACM
15 years 4 days ago
Code injection attacks on harvard-architecture devices
Harvard architecture CPU design is common in the embedded world. Examples of Harvard-based architecture devices are the Mica family of wireless sensors. Mica motes have limited me...
Aurélien Francillon, Claude Castelluccia