Sciweavers

849 search results - page 102 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 9 months ago
Static Analysis using Parameterised Boolean Equation Systems
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...
María-del-Mar Gallardo, Christophe Joubert,...
PVLDB
2008
89views more  PVLDB 2008»
13 years 8 months ago
Constrained physical design tuning
Abstract Existing solutions to the automated physical design problem in database systems attempt to minimize execution costs of input workloads for a given storage constraint. In t...
Nicolas Bruno, Surajit Chaudhuri
MOR
2010
98views more  MOR 2010»
13 years 7 months ago
Sharing the Cost of a Capacity Network
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
Anna Bogomolnaia, Ron Holzman, Hervé Moulin
ICASSP
2009
IEEE
13 years 7 months ago
Robust joint localization and time synchronization in wireless sensor networks with bounded anchor uncertainties
A unified framework to jointly solve the two problems of localization and synchronization at the same time is presented in this paper. The joint approach is attractive because it ...
Jun Zheng, Yik-Chung Wu
ICALP
2011
Springer
13 years 18 days ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner