Sciweavers

4908 search results - page 892 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 4 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
DAC
1994
ACM
15 years 4 months ago
A Communicating Petri Net Model for the Design of Concurrent Asynchronous Modules
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...
Gjalt G. de Jong, Bill Lin
ASPDAC
2007
ACM
123views Hardware» more  ASPDAC 2007»
15 years 3 months ago
Coupling-aware Dummy Metal Insertion for Lithography
As integrated circuits manufacturing technology is advancing into 65nm and 45nm nodes, extensive resolution enhancement techniques (RETs) are needed to correctly manufacture a chip...
Liang Deng, Martin D. F. Wong, Kai-Yuan Chao, Hua ...
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 3 months ago
Evolving distributed agents for managing air traffic
Air traffic management offers an intriguing real world challenge to designing large scale distributed systems using evolutionary computation. The ability to evolve effective air t...
Adrian K. Agogino, Kagan Tumer
BIBE
2004
IEEE
160views Bioinformatics» more  BIBE 2004»
15 years 3 months ago
A Time Series Analysis of Microarray Data
As the capture and analysis of single-time-point microarray expression data becomes routine, investigators are turning to time-series expression data to investigate complex gene r...
Selnur Erdal, Ozgur Ozturk, David L. Armbruster, H...