Sciweavers

1002 search results - page 124 / 201
» Towards Graph Programs for Graph Algorithms
Sort
View
SIGGRAPH
1994
ACM
15 years 6 months ago
Evolving virtual creatures
This paper describes a novel system for creating virtual creatures that move and behave in simulated three-dimensional physical worlds. The morphologies of creatures and the neura...
Karl Sims
ESANN
2004
15 years 3 months ago
Neural methods for non-standard data
Standard pattern recognition provides effective and noise-tolerant tools for machine learning tasks; however, most approaches only deal with real vectors of a finite and fixed dime...
Barbara Hammer, Brijnesh J. Jain
93
Voted
CAGD
2007
75views more  CAGD 2007»
15 years 2 months ago
Computing roots of polynomials by quadratic clipping
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
Michael Barton, Bert Jüttler
ICALP
2003
Springer
15 years 7 months ago
Online Load Balancing Made Simple: Greedy Strikes Back
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia...
ICALP
2001
Springer
15 years 7 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan