Sciweavers

3134 search results - page 487 / 627
» Computing full disjunctions
Sort
View
CLOUD
2010
ACM
14 years 3 months ago
Nephele/PACTs: a programming model and execution framework for web-scale analytical processing
We present a parallel data processor centered around a programming model of so called Parallelization Contracts (PACTs) and the scalable parallel execution engine Nephele [18]. Th...
Dominic Battré, Stephan Ewen, Fabian Hueske...
EUROSYS
2010
ACM
14 years 3 months ago
Defeating return-oriented rootkits with "Return-Less" kernels
Targeting the operating system (OS) kernels, kernel rootkits pose a formidable threat to computer systems and their users. Recent efforts have made significant progress in blocki...
Jinku Li, Zhi Wang, Xuxian Jiang, Michael C. Grace...
IWCMC
2010
ACM
14 years 3 months ago
Only the short die old: route optimization in MANETs by dynamic subconnection shrinking
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may mak...
Zeki Bilgin, Bilal Khan, Ala I. Al-Fuqaha
EDOC
2002
IEEE
14 years 3 months ago
Business Modelling for Component Systems with UML
The EC funded COMBINE Project has the objective of dramatically improving software development productivity by providing a holistic approach to component-based development of Ente...
Sandy Tyndale-Biscoe, Oliver Sims, Bryan Wood, Chr...
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 3 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...