Sciweavers

8540 search results - page 268 / 1708
» The Dynamic Servers Problem
Sort
View
166
Voted
SIGMOD
2001
ACM
229views Database» more  SIGMOD 2001»
16 years 3 months ago
A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya
118
Voted
SCAM
2007
IEEE
15 years 10 months ago
Barrier Slicing for Remote Software Trusting
Remote trusting aims at verifying the “healthy” execution of a program running on an untrusted client that communicates with a trusted server via network connection. After giv...
Mariano Ceccato, Mila Dalla Preda, Jasvir Nagra, C...
127
Voted
DBSEC
2010
129views Database» more  DBSEC 2010»
15 years 5 months ago
Secure Outsourcing of DNA Searching via Finite Automata
This work treats the problem of error-resilient DNA searching via oblivious evaluation of finite automata, formulated as follows: a client has a DNA sequence, and a service provid...
Marina Blanton, Mehrdad Aliasgari
117
Voted
SOCIALCOM
2010
15 years 1 months ago
Minimizing Disclosure of Private Information in Credential-based Interactions: A Graph-based Approach
We address the problem of enabling clients to regulate disclosure of their credentials and properties when interacting with servers in open scenarios. We provide a means for client...
Claudio Agostino Ardagna, Sabrina De Capitani di V...
139
Voted
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
15 years 10 months ago
An approximate dynamic programming approach to probabilistic reachability for stochastic hybrid systems
— This paper addresses the computational overhead involved in probabilistic reachability computations for a general class of controlled stochastic hybrid systems. An approximate ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...