Sciweavers

392 search results - page 51 / 79
» Negation as Partial Failure
Sort
View
INFOCOM
2012
IEEE
11 years 10 months ago
NSDMiner: Automated discovery of Network Service Dependencies
—Enterprise networks today host a wide variety of network services, which often depend on each other to provide and support network-based services and applications. Understanding...
Arun Natarajan, Peng Ning, Yao Liu, Sushil Jajodia...
SIGIR
2012
ACM
11 years 10 months ago
Robust ranking models via risk-sensitive optimization
Many techniques for improving search result quality have been proposed. Typically, these techniques increase average effectiveness by devising advanced ranking features and/or by...
Lidan Wang, Paul N. Bennett, Kevyn Collins-Thompso...
LPKR
1997
Springer
13 years 12 months ago
Knowledge Representation with Logic Programs
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
Gerhard Brewka, Jürgen Dix
JMM2
2006
212views more  JMM2 2006»
13 years 7 months ago
K-means Tracker: A General Algorithm for Tracking People
Abstract-- In this paper, we present a clustering-based tracking algorithm for tracking people (e.g. hand, head, eyeball, body, and lips). It is always a challenging task to track ...
Chunsheng Hua, Haiyuan Wu, Qian Chen, Toshikazu Wa...
SAC
2010
ACM
14 years 2 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...