Sciweavers

488 search results - page 47 / 98
» Automorphic Decompositions of Graphs
Sort
View
AIPS
1996
13 years 9 months ago
Event-Based Decompositions for Reasoning about External Change in Planners
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
Jim Blythe
EMNLP
2010
13 years 5 months ago
Automatic Keyphrase Extraction via Topic Decomposition
Existing graph-based ranking methods for keyphrase extraction compute a single importance score for each word via a single random walk. Motivated by the fact that both documents a...
Zhiyuan Liu, Wenyi Huang, Yabin Zheng, Maosong Sun
ICPR
2006
IEEE
14 years 8 months ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai
ICDE
2010
IEEE
209views Database» more  ICDE 2010»
14 years 1 months ago
Overlapping Community Search for social networks
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
Arnau Padrol-Sureda, Guillem Perarnau-Llobet, Juli...
JCB
2006
124views more  JCB 2006»
13 years 7 months ago
The Distribution of Genomic Distance between Random Genomes
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...
David Sankoff, Lani Haque