1002 search results - page 170 / 201 » Towards Graph Programs for Graph Algorithms |
144
click to vote
ITP
2010
15 years 3 months ago
2010
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
134
click to vote
RC
2000
15 years 1 months ago
2000
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...
132
click to vote
JMLR
2012
13 years 4 months ago
2012
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
110
click to vote
SOSP
2003
ACM
15 years 10 months ago
2003
ACM
This paper presents Capriccio, a scalable thread package for use with high-concurrency servers. While recent work has advocated event-based systems, we believe that threadbased sy...
121
Voted
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...