2645 search results - page 116 / 529 » time 2003 |
164
click to vote
IPPS
2003
IEEE
16 years 3 days ago
2003
IEEE
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
173
click to vote
COMPGEOM
2003
ACM
16 years 2 days ago
2003
ACM
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
166
click to vote
PODC
2003
ACM
16 years 2 days ago
2003
ACM
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
158
click to vote
AOSE
2003
Springer
16 years 2 days ago
2003
Springer
A helpful abstraction of a group of agents is a set of interacting roles, or sets of normative behaviors, that the agents can assume. An important characteristic of real-world agen...
158
click to vote
WADS
2001
Springer
15 years 11 months ago
2001
Springer
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta ...