Sciweavers

1648 search results - page 61 / 330
» On the generation of bicliques of a graph
Sort
View
AAAI
2006
15 years 25 days ago
Domain-Independent Structured Duplicate Detection
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
Rong Zhou, Eric A. Hansen
ECEASST
2010
14 years 8 months ago
Conditional Adaptive Star Grammars
Abstract. The precise specification of software models is a major concern in model-driven design of object-oriented software. In this paper, we investigate how program graphs, a la...
Berthold Hoffmann
196
Voted
AMW
2011
14 years 3 months ago
SNQL: A Social Networks Query and Transformation Language
Abstract. Social Network (SN) data has become ubiquitous, demanding advanced and flexible means to represent, transform and query such data. In addition to the intrinsic challenge...
Mauro San Martín, Claudio Gutierrez, Peter ...
ICPR
2006
IEEE
16 years 16 days 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
JCT
2006
102views more  JCT 2006»
14 years 11 months ago
Minimal bricks
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletio...
Serguei Norine, Robin Thomas