5606 search results - page 457 / 1122 » Randomization Techniques for Graphs. |
154
click to vote
JOLLI
2006
15 years 6 months ago
2006
Applying the programming-language concept of continuations, we propose a new multimodal analysis of quantification in Type Logical Grammar. Our approach naturally gives rise to a n...
167
click to vote
IJKDB
2010
15 years 4 months ago
2010
Searching for repeated features characterizing biological data is fundamental in computational biology. When biological networks are under analysis, the presence of repeated modul...
199
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
184
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
163
click to vote
TCS
2008
15 years 6 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...