Sciweavers

1369 search results - page 150 / 274
» A Practical Implementation of the Timing Attack
Sort
View
CADE
2010
Springer
15 years 10 days ago
Optimized Description Logic Reasoning via Core Blocking
State of the art reasoners for expressive description logics, such as those that underpin the OWL ontology language, are typically based on highly optimized implementations of (hyp...
Birte Glimm, Ian Horrocks, Boris Motik
TWC
2011
219views more  TWC 2011»
14 years 6 months ago
Utility-Optimal Multi-Pattern Reuse in Multi-Cell Networks
—Achieving sufficient spatial capacity gain through the use of small cells requires careful consideration of intercell interference (ICI) management via BS power coordination co...
Kyuho Son, Yung Yi, Song Chong
DALT
2007
Springer
15 years 5 months ago
Composing High-Level Plans for Declarative Agent Programming
Abstract. Research on practical models of autonomous agents has largely focused on a procedural view of goal achievement. This allows for efficient implementations, but prevents an...
Felipe Rech Meneguzzi, Michael Luck
CIAC
1997
Springer
111views Algorithms» more  CIAC 1997»
15 years 3 months ago
A Meticulous Analysis of Mergesort Programs
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
Jyrki Katajainen, Jesper Larsson Träff
INFOCOM
2010
IEEE
14 years 9 months ago
High-Speed Per-Flow Traffic Measurement with Probabilistic Multiplicity Counting
On today's high-speed backbone network links, measuring per-flow traffic information has become very challenging. Maintaining exact per-flow packet counters on OC-192 or OC-76...
Peter Lieven, Björn Scheuermann