Sciweavers

1369 search results - page 182 / 274
» A Practical Implementation of the Timing Attack
Sort
View
ICDM
2002
IEEE
132views Data Mining» more  ICDM 2002»
15 years 4 months ago
Speed-up Iterative Frequent Itemset Mining with Constraint Changes
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
Gao Cong, Bing Liu
EMMCVPR
2001
Springer
15 years 3 months ago
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
Yuri Boykov, Vladimir Kolmogorov
JSA
2008
108views more  JSA 2008»
14 years 11 months ago
A methodology to design arbitrary failure detectors for distributed protocols
Nowadays, there are many protocols able to cope with process crashes, but, unfortunately, a process crash represents only a particular faulty behavior. Handling tougher failures (...
Roberto Baldoni, Jean-Michel Hélary, Sara T...
OSDI
2006
ACM
15 years 11 months ago
Splitting Interfaces: Making Trust Between Applications and Operating Systems Configurable
In current commodity systems, applications have no way of limiting their trust in the underlying operating system (OS), leaving them at the complete mercy of an attacker who gains...
Richard Ta-Min, Lionel Litty, David Lie
MICRO
2009
IEEE
168views Hardware» more  MICRO 2009»
15 years 5 months ago
Ordering decoupled metadata accesses in multiprocessors
Hardware support for dynamic analysis can minimize the performance overhead of useful applications such as security checks, debugging, and profiling. To eliminate implementation ...
Hari Kannan