Sciweavers

5606 search results - page 112 / 1122
» Randomization Techniques for Graphs.
Sort
View
WWW
2006
ACM
14 years 11 months ago
Using graph matching techniques to wrap data from PDF documents
Wrapping is the process of navigating a data source, semiautomatically extracting data and transforming it into a form suitable for data processing applications. There are current...
Tamir Hassan, Robert Baumgartner
WONS
2005
IEEE
14 years 4 months ago
Frequency Allocation for WLANs Using Graph Colouring Techniques
At present, no standard frequency allocation mechanism exists for Wireless LAN access points. In this article, we introduce a number of techniques based on graph colouring algorit...
Janne Riihijärvi, Marina Petrova, Petri M&aum...
ISLPED
2003
ACM
96views Hardware» more  ISLPED 2003»
14 years 3 months ago
Effective graph theoretic techniques for the generalized low power binding problem
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
Azadeh Davoodi, Ankur Srivastava
SODA
2010
ACM
142views Algorithms» more  SODA 2010»
13 years 9 months ago
Speeding up random walks with neighborhood exploration
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
Petra Berenbrink, Colin Cooper, Robert Elsaesser, ...
ICIP
2007
IEEE
15 years 1 days ago
Automated Segmentation of Torn Frames using the Graph Cuts Technique
Film Tear is a form of degradation in archived film and is the physical ripping of the film material. Tear causes displacement of a region of the degraded frame and the loss of im...
David Corrigan, Naomi Harte, Anil C. Kokaram