Sciweavers

1163 search results - page 200 / 233
» Department of Redundancy Department
Sort
View
COMPGEOM
1992
ACM
13 years 11 months ago
On-Line Steiner Trees in the Euclidean Plane
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
Noga Alon, Yossi Azar
KDD
1994
ACM
117views Data Mining» more  KDD 1994»
13 years 11 months ago
Application of the TETRAD II Program to the Study of Student Retention in U.S. Colleges
We applied TETRAD II, a causal discovery program developed in Carnegie Mellon University's Department of Philosophy, to a database containing information on 204 U.S. colleges...
Marek J. Druzdze, Clark Glymour
SPAA
1993
ACM
13 years 11 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
13 years 11 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo
VLDB
1994
ACM
121views Database» more  VLDB 1994»
13 years 11 months ago
An Overview of Repository Technology
A repository is a shareddatabaseof information aboutengineeredartifacts.Wedefinea repository manager to be a databaseapplication that suPports checkout/checkin, version and config...
Philip A. Bernstein, Umeshwar Dayal