Sciweavers

14 search results - page 2 / 3
» How Good Is Sink Insertion
Sort
View
IEICET
2006
55views more  IEICET 2006»
13 years 8 months ago
Inserting Points Uniformly at Every Instance
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjam...
ICCAD
2000
IEEE
102views Hardware» more  ICCAD 2000»
14 years 1 months ago
Provably Good Global Buffering Using an Available Buffer Block Plan
To implement high-performance global interconnect without impacting the performance of existing blocks, the use of buffer blocks is increasingly popular in structured-custom and b...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
NORDSEC
2009
Springer
14 years 3 months ago
Towards Practical Enforcement Theories
Runtime enforcement is a common mechanism for ensuring that program executions adhere to constraints specified by a security policy. It is based on two simple ideas: the enforceme...
Nataliia Bielova, Fabio Massacci, Andrea Michelett...
BIRTHDAY
2006
Springer
14 years 11 days ago
Optimal Flow Distribution Among Multiple Channels with Unknown Capacities
Consider a simple network flow problem in which there are n channels directed from a source to a sink. The channel capacities are unknown and we wish to determine a feasible netwo...
Richard M. Karp, Till Nierhoff, Till Tantau
SUTC
2010
IEEE
13 years 7 months ago
Reordering for Better Compressibility: Efficient Spatial Sampling in Wireless Sensor Networks
—Compressed Sensing (CS) is a novel sampling paradigm that tries to take data-compression concepts down to the sampling layer of a sensory system. It states that discrete compres...
Mohammadreza Mahmudimanesh, Abdelmajid Khelil, Nee...