10289 search results - page 128 / 2058 » Standard bases in K |
195
click to vote
ISAAC
2009
Springer
16 years 28 days ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
238
click to vote
Publication
James A. Skarie, Biplob K. Debnath, David J. Lilja, and Mohamed F. Mokbel. "SCRAP: A Statistical Approach for Creating Compact Representational Query Workload based on Perform...
172
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
180
click to vote
ICPADS
1998
IEEE
15 years 10 months ago
1998
IEEE
We extend a torus-based coterie structure for distributed mutual exclusion to allow k multiple entries in a critical section. In the original coterie, the system nodes are logical...
194
click to vote
SPAA
2005
ACM
15 years 12 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...