Sciweavers

2969 search results - page 157 / 594
» A space efficient algorithm for group structure computation
Sort
View
119
Voted
SOFSEM
2010
Springer
16 years 14 days ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz
126
Voted
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
15 years 10 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...
135
Voted
DASFAA
2004
IEEE
87views Database» more  DASFAA 2004»
15 years 7 months ago
UB-Tree Based Efficient Predicate Index with Dimension Transform for Pub/Sub System
For event filtering of publish/subscribe system, significant research efforts have been dedicated to techniques based on multiple one-dimensional indexes built on attributes of sub...
Botao Wang, Wang Zhang, Masaru Kitsuregawa
IRREGULAR
1997
Springer
15 years 7 months ago
Parallel Shared-Memory State-Space Exploration in Stochastic Modeling
Stochastic modeling forms the basis for analysis in many areas, including biological and economic systems, as well as the performance and reliability modeling of computers and comm...
Susann C. Allmaier, Graham Horton
156
Voted
HPDC
1997
IEEE
15 years 7 months ago
A Directory Service for Configuring High-Performance Distributed Computations
High-performance execution in distributed computing environments often requires careful selection and configuration not only of computers, networks, and other resources but also o...
Steven Fitzgerald, Ian T. Foster, Carl Kesselman, ...