5606 search results - page 489 / 1122 » Randomization Techniques for Graphs. |
163
click to vote
ICDM
2006
IEEE
16 years 26 days ago
2006
IEEE
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
182
click to vote
GLVLSI
2002
IEEE
15 years 11 months ago
2002
IEEE
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
203
click to vote
ICPP
2002
IEEE
15 years 11 months ago
2002
IEEE
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
160
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
158
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
Word Sense Induction (WSI) is the task of identifying the different senses (uses) of a target word in a given text. Traditional graph-based approaches create and then cluster a gra...