1503 search results - page 141 / 301 » Detecting Anomalies in Graphs |
163
click to vote
JPDC
2006
15 years 6 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
136
click to vote
ACL
2009
15 years 4 months ago
2009
Past work on English coordination has focused on coordination scope disambiguation. In Japanese, detecting whether coordination exists in a sentence is also a problem, and the sta...
195
click to vote
JCP
2008
15 years 6 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
212
click to vote
CIMAGING
2009
15 years 7 months ago
2009
We introduce "contour stencils" as a simple method for detecting the local orientation of image contours and apply this detection to image zooming. Our approach is motiv...
168
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...