3172 search results - page 133 / 635 » On the Random-Self-Reducibility of Complete Sets |
155
click to vote
ICCAD
1996
IEEE
15 years 10 months ago
1996
IEEE
A scan-based BIST scheme is presented which guarantees complete fault coverage with very low hardware overhead. A probabilistic analysis shows that the output of an LFSR which fee...
163
click to vote
IJCAI
2003
15 years 7 months ago
2003
Information integration systems provide a uniform query interface to a set of sources. One of the key challenges for an information integration system is to provide maximally comp...
168
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
191
click to vote
CIMCA
2006
IEEE
16 years 15 days ago
2006
IEEE
A junction based approach for Segmenting and recognizing offline handwritten connected twodigit strings is presented in this paper. Very often even in a printed text, adjacent cha...
170
click to vote
WINE
2005
Springer
15 years 12 months ago
2005
Springer
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m identical, non-intersecting, and parallel links. For suc...