Sciweavers

2766 search results - page 188 / 554
» Algorithms for trigonometric polynomials
Sort
View
COLT
2001
Springer
15 years 9 months ago
Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries
We present results concerning the learning of Monotone DNF (MDNF) from Incomplete Membership Queries and Equivalence Queries. Our main result is a new algorithm that allows effici...
Nader H. Bshouty, Nadav Eiron
FCCM
2009
IEEE
106views VLSI» more  FCCM 2009»
15 years 8 months ago
Optimal Placement-aware Trace-Based Scheduling of Hardware Reconfigurations for FPGA Accelerators
Modern use of FPGAs as hardware accelerators involves the partial reconfiguration of hardware resources as the application executes. In this paper, we present a polynomial time al...
Joon Edward Sim, Weng-Fai Wong, Jürgen Teich
VMV
2000
115views Visualization» more  VMV 2000»
15 years 5 months ago
Metrical Calibration of a Phase Measuring Triangulation Sensor
Metrical calibration is very critical for the accuracy of a 3d sensor. Measuring uncertainty of about 1:3000 of the z-range requires a calibration accuracy of about 1:104 . Severa...
Klaus Veit, Gerd Häusler
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 4 months ago
A lower bound for the tree-width of planar graphs with vital linkages
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...
Isolde Adler, Philipp Klaus Krause
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 4 months ago
Generating Random Graphs with Large Girth
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
Mohsen Bayati, Andrea Montanari, Amin Saberi