1538 search results - page 203 / 308 » Spectral Techniques in Graph Algorithms |
120
click to vote
SBBD
2007
15 years 3 months ago
2007
Abstract. A lot of recent applications dealing with complex data require sophisticated data structures (trees or graphs) for their specification. Recently, several techniques for ...
134
click to vote
WCE
2007
15 years 2 months ago
2007
Improving testability during the early stages of High-level synthesis has several advantages including reduced test hardware overhead and design iterations. Recently, BIST techniq...
113
Voted
AI
2010
Springer
15 years 1 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
114
click to vote
RV
2010
Springer
14 years 11 months ago
2010
Springer
Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict ...
128
click to vote
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...