Sciweavers

1162 search results - page 60 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
132
Voted
MVA
2007
149views Computer Vision» more  MVA 2007»
15 years 5 months ago
Fast Graph Segmentation Based on Statistical Aggregation Phenomena
In this paper, we first generalize a recent statistical color image segmentation algorithm [5] to arbitrary graphs, and report its performance for 2D images, 3D meshes and volume...
Frank Nielsen, Richard Nock
145
Voted
MASS
2010
159views Communications» more  MASS 2010»
14 years 10 months ago
Efficient WiFi deployment algorithms based on realistic mobility characteristics
Abstract--Recent years have witnessed the emergence of numerous new Internet services for mobile users. Supporting mobile applications via public WiFi networks has received signifi...
Tian Wang, Guoliang Xing, Minming Li, Weijia Jia
141
Voted
IFIP12
2009
15 years 1 months ago
Revealing Paths of Relevant Information in Web Graphs
In this paper we propose a web search methodology based on the Ant Colony Optimization (ACO) algorithm, which aims to enhance the amount of the relevant information in respect to a...
Georgios Kouzas, Vassilis Kolias, Ioannis Anagnost...
134
Voted
JCP
2008
87views more  JCP 2008»
15 years 3 months ago
VLSI Architecture of a Cellular Automata based One-Way Function
In this paper, a technique to generate expander graphs using Cellular Automata (CA) has been presented. The special class of CA, known as the Two Predecessor Single Attractor Cellu...
Debdeep Mukhopadhyay, Pallavi Joshi, Dipanwita Roy...
140
Voted
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
15 years 9 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky