268 search results - page 37 / 54 » Growing Protean Graphs |
134
click to vote
NAACL
2010
14 years 11 months ago
2010
We present a random-walk-based approach to learning paraphrases from bilingual parallel corpora. The corpora are represented as a graph in which a node corresponds to a phrase, an...
127
click to vote
ATMOS
2007
15 years 3 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
129
click to vote
GD
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. As the number of devices connected to the internet continues to grow rapidly and software systems are being increasingly deployed on the web, security and privacy have be...
98
Voted
CCR
2004
15 years 1 months ago
2004
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
145
click to vote
BCB
2010
14 years 9 months ago
2010
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...