3267 search results - page 310 / 654 » Generalized quasirandom graphs |
187
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
Temporal text mining deals with discovering temporal patterns in text over a period of time. A Theme Evolution Graph (TEG) is used to visualize when new themes are created and how...
188
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
150
click to vote
CASES
2009
ACM
16 years 1 months ago
2009
ACM
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
188
click to vote
ICALP
2007
Springer
16 years 29 days ago
2007
Springer
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
155
click to vote
FSE
2005
Springer
16 years 9 days ago
2005
Springer
T-functions were introduced by Klimov and Shamir in a series of papers during the last few years. They are of great interest for cryptography as they may provide some new building ...