9209 search results - page 1669 / 1842 » Data Space Randomization |
138
click to vote
JMLR
2002
15 years 3 months ago
2002
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
131
click to vote
PR
2002
15 years 3 months ago
2002
Search by Object Model -- finding an object inside a target image -- is a desirable and yet difficult mechanism for querying multimedia data. An added difficulty is that objects c...
117
click to vote
TIT
1998
15 years 3 months ago
1998
—In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbit...
149
click to vote
SIGIR
2002
ACM
15 years 3 months ago
2002
ACM
Document clustering is useful in many information retrieval tasks: document browsing, organization and viewing of retrieval results, generation of Yahoo-like hierarchies of docume...
135
click to vote
TROB
2002
15 years 3 months ago
2002
We have designed and built a set of miniature robots called Scouts and have developed a distributed software system to control them. This paper addresses the fundamental choices we...