Sciweavers

82 search results - page 9 / 17
» Two Results on Real Zeros of Chromatic Polynomials
Sort
View
CPC
2006
73views more  CPC 2006»
13 years 7 months ago
Feasible Schedules for Rotating Transmissions
Motivated by a scheduling problem that arises in the study of optical networks we prove the following result, which is a variation of a conjecture of Haxell, Wilfong and Winkler. ...
Noga Alon
PODS
2006
ACM
196views Database» more  PODS 2006»
14 years 7 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
13 years 11 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
CORR
2012
Springer
185views Education» more  CORR 2012»
12 years 3 months ago
Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective
Identifying and controlling bias is a key problem in empirical sciences. Causal diagram theory provides graphical criteria for deciding whether and how causal effects can be iden...
Johannes Textor, Maciej Liskiewicz
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 4 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...