Sciweavers

621 search results - page 46 / 125
» An Expressive and Efficient Solution to the Service Selectio...
Sort
View
TISSEC
2002
123views more  TISSEC 2002»
14 years 9 months ago
An algebraic approach to IP traceback
We present a new solution to the problem of determining the path a packet traversed over the Internet (called the traceback problem) during a denial of service attack. Previous so...
Drew Dean, Matthew K. Franklin, Adam Stubblefield
IUI
2004
ACM
15 years 3 months ago
Designing example-critiquing interaction
In many practical scenarios, users are faced with the problem of choosing the most preferred outcome from a large set of possibilities. As people are unable to sift through them m...
Boi Faltings, Pearl Pu, Marc Torrens, Paolo Viappi...
PODS
2006
ACM
138views Database» more  PODS 2006»
15 years 9 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
TSP
2010
14 years 4 months ago
Variance-component based sparse signal reconstruction and model selection
We propose a variance-component probabilistic model for sparse signal reconstruction and model selection. The measurements follow an underdetermined linear model, where the unknown...
Kun Qiu, Aleksandar Dogandzic
SIGOPS
2010
163views more  SIGOPS 2010»
14 years 4 months ago
Automated control of internet services
Finding an efficient configuration for cluster-based multi-tier Internet services is often a difficult task. Moreover, even a good configuration could become obsolete, depending o...
Jean Arnaud