Sciweavers

5607 search results - page 309 / 1122
» Graph structure in the Web
Sort
View
ICIAP
2009
ACM
15 years 4 months ago
Tree Covering within a Graph Kernel Framework for Shape Classification
Abstract. Shape classification using graphs and skeletons usually involves edition processes in order to reduce the influence of structural noise. However, edition distances can no...
François-Xavier Dupé, Luc Brun
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 4 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry
MICS
2010
124views more  MICS 2010»
15 years 1 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
CVPR
2012
IEEE
13 years 9 months ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee
WEBDB
2004
Springer
100views Database» more  WEBDB 2004»
16 years 1 days ago
Spam, Damn Spam, and Statistics: Using Statistical Analysis to Locate Spam Web Pages
The increasing importance of search engines to commercial web sites has given rise to a phenomenon we call “web spam”, that is, web pages that exist only to mislead search eng...
Dennis Fetterly, Mark Manasse, Marc Najork