Sciweavers

224 search results - page 6 / 45
» A Derivative-Free Algorithm for Computing Zeros of Analytic ...
Sort
View
SAC
2006
ACM
14 years 1 months ago
Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
Michael Orshansky, Wei-Shen Wang, Martine Ceberio,...
CAGD
2010
125views more  CAGD 2010»
13 years 5 months ago
Precise Hausdorff distance computation between polygonal meshes
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events wh...
Michael Barton, Iddo Hanniel, Gershon Elber, Myung...
CIDR
2011
253views Algorithms» more  CIDR 2011»
12 years 11 months ago
Answering Queries using Humans, Algorithms and Databases
For some problems, human assistance is needed in addition to automated (algorithmic) computation. In sharp contrast to existing data management approaches, where human input is ei...
Aditya G. Parameswaran, Neoklis Polyzotis
AAAI
1993
13 years 9 months ago
Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
Michael J. Pazzani, Clifford Brunk
CORR
2007
Springer
173views Education» more  CORR 2007»
13 years 7 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge