Sciweavers

1149 search results - page 158 / 230
» Minimally non-Pfaffian graphs
Sort
View
SIGSOFT
2008
ACM
16 years 7 months ago
Effective blame for information-flow violations
Programs trusted with secure information should not release that information in ways contrary to system policy. However, when a program contains an illegal flow of information, cu...
Dave King 0002, Trent Jaeger, Somesh Jha, Sanjit A...
WWW
2005
ACM
16 years 6 months ago
WEBCAP: a capacity planning tool for web resource management
A staggering number of multimedia applications are being introduced every day. Yet, the inordinate delays encountered in retrieving multimedia documents make it difficult to use t...
Sami Habib, Maytham Safar
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 6 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
16 years 6 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
ICCAD
2008
IEEE
141views Hardware» more  ICCAD 2008»
16 years 3 months ago
Layout decomposition for double patterning lithography
In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different exposures)...
Andrew B. Kahng, Chul-Hong Park, Xu Xu, Hailong Ya...