Sciweavers

20294 search results - page 329 / 4059
» Algorithmic Information Theory
Sort
View
IEEECIT
2010
IEEE
15 years 5 months ago
CFCSS without Aliasing for SPARC Architecture
With the increasing popularity of COTS (commercial off the shelf) components and multi-core processor in space and aviation applications, software fault tolerance becomes attracti...
Chao Wang, Zhongchuan Fu, Hongsong Chen, Wei Ba, B...
INFOCOM
2000
IEEE
15 years 11 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
SIGIR
2006
ACM
16 years 23 days ago
Theoretical benchmarks of XML retrieval
This poster investigates the use of theoretical benchmarks to describe the matching functions of XML retrieval systems and the properties of specificity and exhaustivity in XML r...
Tobias Blanke, Mounia Lalmas
ITRUST
2005
Springer
16 years 9 days ago
Risk Models for Trust-Based Access Control(TBAC)
The importance of risk in trust-based systems is well established. This paper presents a novel model of risk and decision-making based on economic theory. Use of the model is illus...
Nathan Dimmock, Jean Bacon, David Ingram, Ken Mood...
CORR
2011
Springer
156views Education» more  CORR 2011»
14 years 10 months ago
From joint convexity of quantum relative entropy to a concavity theorem of Lieb
This paper provides a succinct proof of a 1973 theorem of Lieb that establishes the concavity of a certain trace function. The development relies on a deep result from quantum info...
Joel A. Tropp