Sciweavers

174 search results - page 13 / 35
» Permutation Groups in NC
Sort
View
ISPDC
2006
IEEE
14 years 1 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
CIKM
2006
Springer
13 years 11 months ago
Improving query I/O performance by permuting and refining block request sequences
The I/O performance of query processing can be improved using two complementary approaches. One can try to improve on the buffer and the file system management policies of the DB ...
Xiaoyu Wang, Mitch Cherniack
EJC
2011
12 years 11 months ago
Two enumerative results on cycles of permutations
Answering a question of B´ona, it is shown that for n ≥ 2 the probability that 1 and 2 are in the same cycle of a product of two n-cycles on the set {1, 2, . . . , n} is 1/2 if...
Richard P. Stanley
IPMI
2003
Springer
14 years 8 months ago
Permutation Tests for Classification: Towards Statistical Significance in Image-Based Studies
Abstract. Estimating statistical significance of detected differences between two groups of medical scans is a challenging problem due to the high dimensionality of the data and th...
Polina Golland, Bruce Fischl
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
13 years 9 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou