1686 search results - page 190 / 338 » Programs as polygraphs: computability and complexity |
153
click to vote
JCSS
2000
15 years 3 months ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
154
click to vote
VC
2002
15 years 3 months ago
2002
Implicit surface modeling systems have been used since the mid-1980s for the generation of cartoon-like characters. Recently implicit models combined with constructive solid geome...
116
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—Network tomography has been proposed to ascertain internal network performances from end-to-end measurements. In this work, we present priority probing, an optimal probing schem...
146
click to vote
INFORMS
2010
15 years 2 months ago
2010
Haplotyping estimation from aligned Single Nucleotide Polymorphism (SNP) fragments has attracted more and more attention in the recent years due to its importance in analysis of m...
152
click to vote
ICASSP
2009
IEEE
15 years 1 months ago
2009
IEEE
A unified framework to jointly solve the two problems of localization and synchronization at the same time is presented in this paper. The joint approach is attractive because it ...