3267 search results - page 152 / 654 » Generalized quasirandom graphs |
138
click to vote
CSR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
128
click to vote
SIGIR
2010
ACM
15 years 4 months ago
2010
ACM
We present an approach for answering Entity Retrieval queries using click-through information in query log data from a commercial Web search engine. We compare results using click...
117
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
142
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
148
click to vote
CIKM
2006
Springer
15 years 8 months ago
2006
Springer
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward ...