Sciweavers

242 search results - page 7 / 49
» Object-level Vertical Search
Sort
View
COCOON
2009
Springer
14 years 2 months ago
Sublinear-Time Algorithms for Tournament Graphs
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
Stefan S. Dantchev, Tom Friedetzky, Lars Nagel
ARSCOM
2004
91views more  ARSCOM 2004»
13 years 7 months ago
Edge-critical isometric subgraphs of hypercubes
All cubic partial cubes (i.e., cubic isometric subgraphs of hypercubes) up to 30 vertices and all edge-critical partial cubes up to 14 vertices are presented. The lists of graphs ...
Sandi Klavzar, Alenka Lipovec
PPOPP
2012
ACM
12 years 3 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
ICIP
2009
IEEE
14 years 8 months ago
Solidity Based Local Threshold For Oil Sand Image Segmentation
A novel local threshold algorithm for images with poor illumination and complex texture surface is presented in this paper. This algorithm improves segmentation quality by selecti...
WWW
2010
ACM
13 years 7 months ago
Finding algorithms in scientific articles
Algorithms are an integral part of computer science literature. However, none of the current search engines offer specialized algorithm search facility. We describe a vertical sea...
Sumit Bhatia, Prasenjit Mitra, C. Lee Giles