Sciweavers

7055 search results - page 1030 / 1411
» Some New 4-Designs
Sort
View
SPAA
1993
ACM
15 years 11 months ago
Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
Philip D. MacKenzie, Quentin F. Stout
VLDB
1994
ACM
119views Database» more  VLDB 1994»
15 years 11 months ago
Bulk Loading into an OODB: A Performance Study
Object-oriented database OODB users bring with them large quantities of legacy data megabytes and even gigabytes. In addition, scienti c OODB users continually generate new data. ...
Janet L. Wiener, Jeffrey F. Naughton
ITS
1992
Springer
152views Multimedia» more  ITS 1992»
15 years 11 months ago
People Power: A Human-Computer Collaborative Learning System
Abstract. This paper reports our research work in the new field of humancomputer collaborative learning (HCCL). The general architecture of an HCCL is defined. An HCCL system, call...
Pierre Dillenbourg, John A. Self
PEPM
1992
ACM
15 years 11 months ago
Self-applicable C Program Specialization
A partial evaluator is an automatic program transformation tool. Given as input a general program and part of its input, it can produce a specialized version. If the partial evalu...
Lars Ole Andersen
COCO
1990
Springer
50views Algorithms» more  COCO 1990»
15 years 11 months ago
Width-Bounded Reducibility and Binary Search over Complexity Classes
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
Eric Allender, Christopher B. Wilson
« Prev « First page 1030 / 1411 Last » Next »