1172 search results - page 151 / 235 » Path Algorithms on Regular Graphs |
111
Voted
NAACL
2007
15 years 4 months ago
2007
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
122
click to vote
CGO
2003
IEEE
15 years 6 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
129
Voted
FUN
2007
Springer
15 years 6 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
208
click to vote
IJCV
2006
15 years 2 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
104
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...