Sciweavers

2128 search results - page 341 / 426
» A general characterization of indulgence
Sort
View
POPL
2007
ACM
14 years 10 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
POPL
2006
ACM
14 years 10 months ago
A hierarchical model of data locality
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
Chengliang Zhang, Chen Ding, Mitsunori Ogihara, Yu...
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
14 years 10 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
WSDM
2010
ACM
172views Data Mining» more  WSDM 2010»
14 years 7 months ago
Early Online Identification of Attention Gathering Items In Social Media
Activity in social media such as blogs, micro-blogs, social networks, etc is manifested via interaction that involves text, images, links and other information items. Naturally, s...
Michael Mathioudakis, Nick Koudas, Peter Marbach
SOSP
2007
ACM
14 years 7 months ago
Bouncer: securing software by blocking bad input
Attackers exploit software vulnerabilities to control or crash programs. Bouncer uses existing software instrumentation techniques to detect attacks and it generates filters auto...
Manuel Costa, Miguel Castro, Lidong Zhou, Lintao Z...