Sciweavers

13784 search results - page 264 / 2757
» On Computing Functions with Uncertainty
Sort
View
AAECC
2007
Springer
132views Algorithms» more  AAECC 2007»
13 years 9 months ago
Approximate implicitization of planar curves by piecewise rational approximation of the distance function
We present an approximate implicitization method for planar curves. The computed implicit representation is a piecewise rational approximation of the distance function to the given...
Mohamed Shalaby, Bert Jüttler, Josef Schicho
CORR
2007
Springer
57views Education» more  CORR 2007»
13 years 9 months ago
On Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with Feedback
— In this work, we study the problem of evaluating the performance limit of two communication problems that are closely related to each other- source coding with feed-forward and...
Ramji Venkataramanan, S. Sandeep Pradhan
ACL
2009
13 years 7 months ago
The Chinese Aspect Generation Based on Aspect Selection Functions
This paper describes our system for generating Chinese aspect expressions. In the system, the semantics of different aspects is characterized by specific temporal and conceptual f...
Guowen Yang, John A. Bateman
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
14 years 1 months ago
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
Janusz Wojtusiak, Ryszard S. Michalski
SASO
2010
IEEE
13 years 7 months ago
Self-Adaptive Resource Allocation in Open Distributed Systems
In an open distributed system, computational resources are peer-owned, and distributed over time and space. The fact that these resources can dynamically join or leave the system (...
Xinghui Zhao, Nadeem Jamali