3775 search results - page 257 / 755 » The Expression Problem Revisited |
177
click to vote
INFOVIS
2002
IEEE
15 years 11 months ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
169
click to vote
EMO
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Topology design of enterprise networks is a hard combinatorial optimization problem. It has numerous constraints, several objectives, and a very noisy solution space. Bes...
160
Voted
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which...
178
click to vote
PODS
1998
ACM
15 years 10 months ago
1998
ACM
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
180
click to vote
ISMVL
1997
IEEE
15 years 10 months ago
1997
IEEE
In this paper, the minimization of incompletely specified multi-valued functions using functional decomposition is discussed. From the aspect of machine learning, learning sample...