Sciweavers

244 search results - page 25 / 49
» Balanced Cayley graphs and balanced planar graphs
Sort
View
INFOCOM
2005
IEEE
14 years 2 months ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu
ICIAR
2010
Springer
13 years 7 months ago
Adaptive Regularization Parameter for Graph Cut Segmentation
Abstract. Graph cut minimization formulates the segmentation problem as the liner combination of data and smoothness terms. The smoothness term is included in the energy formulatio...
Sema Candemir, Yusuf Sinan Akgul
IPPS
2007
IEEE
14 years 3 months ago
iC2mpi: A Platform for Parallel Execution of Graph-Structured Iterative Computations
Parallelization of sequential programs is often daunting because of the substantial development cost involved. Various solutions have been proposed to address this concern, includ...
Harnish Botadra, Qiong Cheng, Sushil K. Prasad, Er...
CIKM
2007
Springer
14 years 3 months ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
FOCS
2008
IEEE
14 years 3 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer