2577 search results - page 409 / 516 » Multimedia Question Answering |
112
click to vote
TPDS
2008
15 years 4 months ago
2008
Let k 4 be even and let n 2. Consider a faulty k-ary n-cube Qk n in which the number of node faults fv and the number of link faults fe are such that fv +fe 2n-2. We prove that ...
140
click to vote
TSMC
2008
15 years 4 months ago
2008
Graphical representation may provide effective means of making sense of the complexity and sheer volume of data produced by DNA microarray experiments that monitor the expression p...
134
click to vote
JSYML
2007
15 years 4 months ago
2007
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
164
click to vote
JUCS
2007
15 years 4 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
106
click to vote
APAL
2002
15 years 4 months ago
2002
Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classe...