Sciweavers

9166 search results - page 1531 / 1834
» A framework for comparing models of computation
Sort
View
CCS
2005
ACM
16 years 6 days ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
ISCA
2003
IEEE
123views Hardware» more  ISCA 2003»
15 years 12 months ago
Detecting Global Stride Locality in Value Streams
Value prediction exploits localities in value streams. Previous research focused on exploiting two types of value localities, computational and context-based, in the local value h...
Huiyang Zhou, Jill Flanagan, Thomas M. Conte
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
15 years 8 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
MOBIHOC
2008
ACM
16 years 6 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang
ICS
2010
Tsinghua U.
16 years 4 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
« Prev « First page 1531 / 1834 Last » Next »