Sciweavers

182 search results - page 30 / 37
» Some problems with the notion of context-aware computing
Sort
View
CONCUR
2001
Springer
13 years 12 months ago
The Control of Synchronous Systems, Part II
Abstract. A controller is an environment for a system that achieves a particular control objective by providing inputs to the system without constraining the choices of the system....
Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. ...
FSTTCS
2009
Springer
14 years 2 months ago
Functionally Private Approximations of Negligibly-Biased Estimators
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
André Madeira, S. Muthukrishnan
RIVF
2003
13 years 8 months ago
Airspace Sectorization By Constraint Programming
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
Huy Trandac, Philippe Baptiste, Vu Duong
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 5 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
STACS
2010
Springer
14 years 2 months ago
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
Maurice Jansen