Sciweavers

74 search results - page 9 / 15
» Smallest Color-Spanning Objects
Sort
View
ASPDAC
2010
ACM
637views Hardware» more  ASPDAC 2010»
13 years 5 months ago
A new graph-theoretic, multi-objective layout decomposition framework for double patterning lithography
As Double Patterning Lithography(DPL) becomes the leading candidate for sub-30nm lithography process, we need a fast and lithography friendly decomposition framework. In this pape...
Jae-Seok Yang, Katrina Lu, Minsik Cho, Kun Yuan, D...
INFOCOM
2010
IEEE
13 years 5 months ago
An Axiomatic Theory of Fairness in Network Resource Allocation
We present a set of five axioms for fairness measures in resource allocation. A family of fairness measures satisfying the axioms is constructed. Well-known notions such as -fairne...
Tian Lan, David Kao, Mung Chiang, Ashutosh Sabharw...
ICTCS
2007
Springer
14 years 1 months ago
Analyzing Non-Interference with respect to Classes
The information flow property of Non-Interference was recently relaxed into Abstract NonInterference (ANI), a weakened version where attackers can only observe properties of data,...
Damiano Zanardini
ADBIS
2003
Springer
95views Database» more  ADBIS 2003»
14 years 18 days ago
Distance Join Queries of Multiple Inputs in Spatial Databases
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
13 years 7 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle