3267 search results - page 196 / 654 » Generalized quasirandom graphs |
150
click to vote
SIGIR
2010
ACM
15 years 10 months ago
2010
ACM
In this paper, a language model adapted to graph-based representation of image content is proposed and assessed. The full indexing and retrieval processes are evaluated on two di...
162
click to vote
EMNLP
2006
15 years 8 months ago
2006
Information Extraction (IE) is the task of extracting knowledge from unstructured text. We present a novel unsupervised approach for information extraction based on graph mutual r...
161
click to vote
FLAIRS
2003
15 years 8 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
168
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
156
click to vote
DM
2006
15 years 6 months ago
2006
For an oriented graph G with n vertices, let f(G) denote the minimum number of transitive subtournaments that decompose G. We prove several results on f(G). In particular, if G is...