Sciweavers

697 search results - page 16 / 140
» On the Theory of Average Case Complexity
Sort
View
ICASSP
2010
IEEE
13 years 8 months ago
Alpha-integration of multiple evidence
In pattern recognition, data integration is a processing method to combine multiple sources so that the combined result can be more accurate than a single source. Evidence theory ...
Heeyoul Choi, Anup Katake, Seungjin Choi, Yoonsuck...
INFOCOM
2000
IEEE
14 years 5 days 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
RTA
2005
Springer
14 years 1 months ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
RR
2010
Springer
13 years 6 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof
COCO
2000
Springer
112views Algorithms» more  COCO 2000»
14 years 3 days ago
Combinatorial Interpretation of Kolmogorov Complexity
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
Andrei E. Romashchenko, Alexander Shen, Nikolai K....