Sciweavers

706 search results - page 126 / 142
» Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Sort
View
WWW
2009
ACM
14 years 8 months ago
Fast dynamic reranking in large graphs
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
Purnamrita Sarkar, Andrew W. Moore
ESORICS
2009
Springer
14 years 8 months ago
Data Structures with Unpredictable Timing
Abstract. A range of attacks on network components, such as algorithmic denial-of-service attacks and cryptanalysis via timing attacks, are enabled by data structures for which an ...
Darrell Bethea, Michael K. Reiter
EUROSYS
2007
ACM
13 years 11 months ago
Automatic configuration of internet services
Recent research has found that operators frequently misconfigure Internet services, causing various availability and performance problems. In this paper, we propose a software inf...
Wei Zheng, Ricardo Bianchini, Thu D. Nguyen
ESWS
2008
Springer
13 years 9 months ago
Query Answering and Ontology Population: An Inductive Approach
In order to overcome the limitations of deductive logic-based approaches to deriving operational knowledge from ontologies, especially when data come from distributed sources, indu...
Claudia d'Amato, Nicola Fanizzi, Floriana Esposito
GLOBECOM
2010
IEEE
13 years 5 months ago
Cooperation Stimulation in Cognitive Networks Using Indirect Reciprocity Game Modelling
In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their ow...
Yan Chen, K. J. Ray Liu