Sciweavers

10054 search results - page 1992 / 2011
» On the Complexity of Function Learning
Sort
View
CGF
2004
86views more  CGF 2004»
13 years 7 months ago
Procedural Texture Matching and Transformation
We present a technique for creating a smoothly varying sequence of procedural textures that interpolates between arbitrary input samples of texture. This texture transformation us...
Eric Bourque, Gregory Dudek
CN
2002
82views more  CN 2002»
13 years 7 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer
DM
2000
108views more  DM 2000»
13 years 7 months ago
On completeness of word reversing
Word reversing is a combinatorial operation on words that detects pairs of equivalent words in monoids that admit a presentation of a certain form. Here we give conditions for this...
Patrick Dehornoy
GPEM
2000
80views more  GPEM 2000»
13 years 7 months ago
Explanatory Analysis of the Metabolome Using Genetic Programming of Simple, Interpretable Rules
Genetic programming, in conjunction with advanced analytical instruments, is a novel tool for the investigation of complex biological systems at the whole-tissue level. In this stu...
Helen E. Johnson, Richard J. Gilbert, Michael K. W...
JCNS
2000
165views more  JCNS 2000»
13 years 7 months ago
A Population Density Approach That Facilitates Large-Scale Modeling of Neural Networks: Analysis and an Application to Orientati
We explore a computationally efficient method of simulating realistic networks of neurons introduced by Knight, Manin, and Sirovich (1996) in which integrate-and-fire neurons are ...
Duane Q. Nykamp, Daniel Tranchina
« Prev « First page 1992 / 2011 Last » Next »