1333 search results - page 237 / 267 » Categorial Minimalism |
143
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
174
click to vote
NGITS
1997
Springer
15 years 10 months ago
1997
Springer
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross....
152
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
188
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
142
click to vote
ICSE
1993
IEEE-ACM
15 years 10 months ago
1993
IEEE-ACM
Features are often the basic unit of development for a very large software systems and represent long-term efforts, spanning up to several years from inception to actual use. Deve...