Sciweavers

3378 search results - page 589 / 676
» A universe of binding and computation
Sort
View
SC
2000
ACM
15 years 2 months ago
Parallel Smoothed Aggregation Multigrid: Aggregation Strategies on Massively Parallel Machines
Algebraic multigrid methods offer the hope that multigrid convergence can be achieved (for at least some important applications) without a great deal of effort from engineers an...
Ray S. Tuminaro, Charles Tong
ISD
1999
Springer
149views Database» more  ISD 1999»
15 years 2 months ago
Cost-Effective Determination of Biomass from Aerial Images
This paper describes an ongoing collaborative research program between the Computer Science and the Forestry and Wildlife Management Departments at the University of Massachusetts...
Howard J. Schultz, Dana Slaymaker, Chris Holmes, F...
CIKM
1997
Springer
15 years 2 months ago
Analysis and Design of Server Informative WWW-Sites
The access patterns of the users of a web-site are traditionally analyzed in order to facilitate the user access to the site's information. In this study, however, a systemat...
Amir M. Zarkesh, Jafar Adibi, Cyrus Shahabi, Reza ...
COLT
1994
Springer
15 years 1 months ago
Bayesian Inductive Logic Programming
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
Stephen Muggleton
COMPGEOM
1992
ACM
15 years 1 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl