Sciweavers

5100 search results - page 293 / 1020
» The Linear Complexity of a Graph
Sort
View
CVPR
2012
IEEE
13 years 7 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
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 4 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
COCO
2007
Springer
114views Algorithms» more  COCO 2007»
15 years 10 months ago
Directed Planar Reachability is in Unambiguous Log-Space
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...
SIGMOD
2011
ACM
230views Database» more  SIGMOD 2011»
14 years 7 months ago
GBLENDER: visual subgraph query formulation meets query processing
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, By...
WAIFI
2007
Springer
175views Mathematics» more  WAIFI 2007»
15 years 10 months ago
Attacking the Filter Generator over GF (2 m )
We consider the filter generator over GF(2m ) consisting of a linear feedback shift register of length k that generates a maximal length linear sequence of period 2mk − 1 over G...
Sondre Rønjom, Tor Helleseth