Sciweavers

1813 search results - page 247 / 363
» Calculi of Approximation Spaces
Sort
View
TOG
2012
222views Communications» more  TOG 2012»
13 years 6 months ago
Plastic trees: interactive self-adapting botanical tree models
We present a dynamic tree modeling and representation technique that allows complex tree models to interact with their environment. Our method uses changes in the light distributi...
Sören Pirk, Ondrej Stava, Julian Kratt, Miche...
ICML
1996
IEEE
16 years 5 months ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 4 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
EMSOFT
2009
Springer
15 years 11 months ago
Cache-aware scheduling and analysis for multicores
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu
IJCNN
2007
IEEE
15 years 10 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot