Sciweavers

1145 search results - page 220 / 229
» The Correctness of an Optimized Code Generation
Sort
View
SPAA
1993
ACM
13 years 11 months ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
ACSAC
2004
IEEE
13 years 11 months ago
Using Predators to Combat Worms and Viruses: A Simulation-Based Study
Large-scale attacks generated by fast-spreading or stealthy malicious mobile code, such as flash worms and e-mail viruses, demand new approaches to patch management and disinfecti...
Ajay K. Gupta 0002, Daniel C. DuVarney
TIP
2011
116views more  TIP 2011»
13 years 2 months ago
Interactive Streaming of Stored Multiview Video Using Redundant Frame Structures
—While much of multiview video coding focuses on the rate-distortion performance of compressing all frames of all views for storage or non-interactive video delivery over network...
Gene Cheung, Antonio Ortega, Ngai-Man Cheung
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 8 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 2 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke