Sciweavers

4171 search results - page 816 / 835
» Choice numbers of graphs
Sort
View
PVM
1997
Springer
15 years 10 months ago
Message-Passing Program Development by Ensemble
We present Ensemble, a message-passing implementation methodology, applied to PVM. Ensemble overcomes problems and complexities in developing applications in messagepassing enviro...
John Yiannis Cotronis
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 10 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
STACS
1992
Springer
15 years 10 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
ICDCS
2010
IEEE
15 years 10 months ago
Guaranteeing BGP Stability with a Few Extra Paths
Abstract—Policy autonomy exercised by Autonomous Systems (ASes) on the Internet can result in persistent oscillations in Border Gateway Protocol, the Internet’s inter-domain ro...
Rachit Agarwal, Virajith Jalaparti, Matthew Caesar...
CANS
2006
Springer
136views Cryptology» more  CANS 2006»
15 years 10 months ago
Watermarking Essential Data Structures for Copyright Protection
Software watermarking is a new research area that aims at providing copyright protection for commercial software. It minimizes software piracy by hiding copyright signatures inside...
Qutaiba Albluwi, Ibrahim Kamel