4218 search results - page 150 / 844 » Complete sets of cooperations |
63
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A completion of an m-by-n matrix A with entries in {0,1,} is obtained by setting all -entries to
143
Voted
MST
2010
15 years 2 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
144
Voted
WCNC
2010
IEEE
15 years 7 months ago
2010
IEEE
—In this paper, the mutual cooperative communication between multiple nodes in a wireless network is efficiently achieved through a novel concept of Space-Time Network Coding (S...
126
click to vote
ECCC
2002
15 years 3 months ago
2002
We prove that if for some > 0, NP contains a set that is DTIME(2n )-bi-immune, then NP contains a set that is 2-Turing complete for NP (hence 3-truth-table complete) but not 1-t...
108
Voted
JSS
2007
15 years 3 months ago
2007
Effort prediction is a very important issue for software project management. Historical project data sets are frequently used to support such prediction. But missing data are oft...