Sciweavers

3172 search results - page 154 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
ICDE
2010
IEEE
238views Database» more  ICDE 2010»
16 years 1 months ago
Correlation hiding by independence masking
— Extracting useful correlation from a dataset has been extensively studied. In this paper, we deal with the opposite, namely, a problem we call correlation hiding (CH), which is...
Yufei Tao, Jian Pei, Jiexing Li, Xiaokui Xiao, Ke ...
ACSC
2009
IEEE
16 years 1 months ago
Using Chronological Splitting to Compare Cross- and Single-company Effort Models: Further Investigation
Numerous studies have used historical datasets to build and validate models for estimating software development effort. Very few used a chronological split (where projects’ end ...
Chris Lokan, Emilia Mendes
INFOCOM
2009
IEEE
16 years 1 months ago
Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
Hung Xuan Nguyen, Renata Teixeira, Patrick Thiran,...
ECSQARU
2009
Springer
16 years 1 months ago
On Revising Argumentation-Based Decision Systems
Decision making amounts to define a preorder (usually a complete one) on a set of options. Argumentation has been introduced in decision making analysis. In particular, an argumen...
Leila Amgoud, Srdjan Vesic
LPNMR
2009
Springer
16 years 1 months ago
A Deductive System for FO(ID) Based on Least Fixpoint Logic
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
Ping Hou, Marc Denecker