4926 search results - page 118 / 986 » Two Graph Algorithms On an Associative Computing Model |
120
Voted
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
127
click to vote
ACL
2010
15 years 18 days ago
2010
Is it possible to use sense inventories to improve Web search results diversity for one word queries? To answer this question, we focus on two broad-coverage lexical resources of ...
121
Voted
ICPR
2004
IEEE
16 years 3 months ago
2004
IEEE
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
132
click to vote
DSS
2002
15 years 2 months ago
2002
A thorough understanding of the way in which existing business processes currently practice is essential from the perspectives of both process reengineering and workflow managemen...
159
click to vote
WADS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...