Sciweavers

12741 search results - page 2357 / 2549
» Editorial and call for papers
Sort
View
ITICSE
1997
ACM
15 years 10 months ago
Computer managed, open question, open book assessment
This paper describes the development and use of practical examinations which include a significant element of software control of the administrative process. The educational metho...
John Rosbottom
SIGCOMM
1997
ACM
15 years 10 months ago
Consistent Overhead Byte Stuffing
—Byte stuffing is a process that encodes a sequence of data bytes that may contain ‘illegal’ or ‘reserved’ values, using a potentially longer sequence that contains no oc...
Stuart Cheshire, Mary Baker
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
15 years 10 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
SPAA
1997
ACM
15 years 10 months ago
HARP: A Fast Spectral Partitioner
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
Horst D. Simon, Andrew Sohn, Rupak Biswas
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
15 years 10 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
« Prev « First page 2357 / 2549 Last » Next »