Sciweavers

223 search results - page 17 / 45
» Proving Termination by Bounded Increase
Sort
View
SP
2008
IEEE
134views Security Privacy» more  SP 2008»
13 years 10 months ago
Expressive Declassification Policies and Modular Static Enforcement
This paper provides a way to specify expressive declassification policies, in particular, when, what, and where policies that include conditions under which downgrading is allowed...
Anindya Banerjee, David A. Naumann, Stan Rosenberg
FOCS
2008
IEEE
14 years 5 months ago
Size Bounds and Query Plans for Relational Joins
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
Albert Atserias, Martin Grohe, Dániel Marx
JSAC
2006
157views more  JSAC 2006»
13 years 10 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
IPSN
2005
Springer
14 years 4 months ago
The sensor selection problem for bounded uncertainty sensing models
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
Volkan Isler, Ruzena Bajcsy
CADE
2012
Springer
12 years 1 months ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...