Sciweavers

350 search results - page 37 / 70
» Separation of Partition Inequalities
Sort
View
ACSD
2003
IEEE
95views Hardware» more  ACSD 2003»
14 years 21 days ago
Quasi-Static Scheduling for Concurrent Architectures
This paper presents a synthesis approach for reactive systems that aims at minimizing the overhead introduced by the operating system and the interaction among the concurrent task...
Jordi Cortadella, Alex Kondratyev, Luciano Lavagno...
CORR
2010
Springer
54views Education» more  CORR 2010»
13 years 7 months ago
Polynomial integration on regions defined by a triangle and a conic
We present an efficient solution to the following problem, of relevance in a numerical optimization scheme: calculation of integrals of the type ZZ T {f0} 12 dx dy for quadratic p...
David Sevilla, Daniel Wachsmuth
JCT
2006
60views more  JCT 2006»
13 years 7 months ago
On the number of rectangulations of a planar point set
We investigate the number of different ways in which a rectangle containing a set of n noncorectilinear points can be partitioned into smaller rectangles by n (non-intersecting) s...
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
DS
1992
128views Database» more  DS 1992»
13 years 8 months ago
Achieving Incremental Consistency among Autonomous Replicated Databases
In this paper, we present methods for supporting autonomous updates in replicated databases. Autonomous updates are of particular importance to applications that cannot tolerate t...
Stefano Ceri, Maurice A. W. Houtsma, Arthur M. Kel...
SIGCOMM
2010
ACM
13 years 7 months ago
EffiCuts: optimizing packet classification for memory and throughput
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
Balajee Vamanan, Gwendolyn Voskuilen, T. N. Vijayk...