Sciweavers

13784 search results - page 437 / 2757
» On Computing Functions with Uncertainty
Sort
View
ASAP
2008
IEEE
199views Hardware» more  ASAP 2008»
15 years 8 months ago
An efficient method for evaluating polynomial and rational function approximations
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
Nicolas Brisebarre, Sylvain Chevillard, Milos D. E...
ACE
2004
224views Education» more  ACE 2004»
15 years 8 months ago
Automating the Estimation of Project Size from Software Design Tools Using Modified Function Points
Final year students in the Bachelor of Computing complete an industry project where they work in teams to build an IT system for an external client. Grading projects in these circ...
Jason Ceddia, Martin Dick
ESA
2010
Springer
163views Algorithms» more  ESA 2010»
15 years 8 months ago
On the Huffman and Alphabetic Tree Problem with General Cost Functions
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
Hiroshi Fujiwara, Tobias Jacobs
EWC
2006
101views more  EWC 2006»
15 years 6 months ago
Mesh size functions for implicit geometries and PDE-based gradient limiting
Mesh generation and mesh enhancement algorithms often require a mesh size function to specify the desired size of the elements. We present algorithms for automatic generation of a...
Per-Olof Persson
EMNLP
2010
15 years 4 months ago
Identifying Functional Relations in Web Text
Determining whether a textual phrase denotes a functional relation (i.e., a relation that maps each domain element to a unique range element) is useful for numerous NLP tasks such...
Thomas Lin, Mausam, Oren Etzioni