1007 search results - page 76 / 202 » The Complexity of Futile Questioning |
121
Voted
WSC
1998
15 years 5 months ago
1998
Simulation is widely used for performance analysis of Personal Communication Systems due to their inherent complexity. However, resource demands (cpu-time and memory requirements)...
119
click to vote
EJC
2010
15 years 3 months ago
2010
Mutually unbiased bases (MUBs) in complex vector spaces play several important roles in quantum information theory. At present, even the most elementary questions concerning the m...
ENDM
2007
15 years 3 months ago
2007
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...
150
Voted
DKE
2002
15 years 3 months ago
2002
Recently, there is an interest in using associations between web pages in providing users with pages relevant to what they are currently viewing. We believe that, to enable intell...
155
Voted
SIAMCOMP
1998
15 years 3 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...