1538 search results - page 82 / 308 » Spectral Techniques in Graph Algorithms |
117
click to vote
DEXAW
1999
IEEE
15 years 5 months ago
1999
IEEE
Objects like road networks, CAD/CAM components, electrical or electronic circuits, molecules, can be represented as graphs, in many modern applications. In this paper, we propose ...
117
click to vote
JDA
2006
15 years 1 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
COMAD
2009
15 years 2 months ago
2009
Terms in textual documents tend to occur more in contexts to which they are related. We can exploit this bias by modelling terms and their cooccurrences s, resembling the abstract...
142
click to vote
ECAI
2008
Springer
15 years 3 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
122
click to vote
ECCV
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. A novel hybrid region-based and contour-based multiple object tracking model using optical flow based elastic matching is proposed. The proposed elastic matching model is...