Sciweavers

43 search results - page 7 / 9
» nc 2007
Sort
View
ECCC
2007
115views more  ECCC 2007»
13 years 7 months ago
A (De)constructive Approach to Program Checking
Program checking, program self-correcting and program selftesting were pioneered by [Blum and Kannan] and [Blum, Luby and Rubinfeld] in the mid eighties as a new way to gain conï¬...
Shafi Goldwasser, Dan Gutfreund, Alexander Healy, ...
COMBINATORICA
2007
119views more  COMBINATORICA 2007»
13 years 7 months ago
Complete partitions of graphs
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
Magnús M. Halldórsson, Guy Kortsarz,...
JSAC
2007
95views more  JSAC 2007»
13 years 7 months ago
Experiences in implementing an experimental wide-area GMPLS network
In this article, we describe our experiences in implementing an experimental wide-area GMPLS network called CHEETAH (Circuit-Switched End-to-End Transport Architecture). The key c...
Xiangfei Zhu, Xuan Zheng, Malathi Veeraraghavan
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
13 years 11 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
BIOCOMP
2006
13 years 8 months ago
Acceleration of Covariance Models for Non-coding RNA Search
Stochastic context-free grammar (SCFG) based models for non-coding RNA (ncRNA) gene searches are much more powerful than regular grammar based models due to the ability to model in...
Scott F. Smith 0002