Sciweavers

3096 search results - page 160 / 620
» The Generalized FITC Approximation
Sort
View
ASAP
2010
IEEE
193views Hardware» more  ASAP 2010»
13 years 10 months ago
Automatic generation of polynomial-based hardware architectures for function evaluation
Abstract--Polynomial approximation is a very general technique for the evaluation of a wide class of numerical functions of one variable. This article details an architecture gener...
Florent de Dinechin, Mioara Joldes, Bogdan Pasca
DMIN
2006
115views Data Mining» more  DMIN 2006»
13 years 10 months ago
Indexing Spatio-Temporal Trajectories with Orthogonal Polynomials
Abstract-- In this paper we consider d-dimensional spatiotemporal data (d 1) and ways to approximate and index it. We focus on indexing such data for similarity matching using orth...
Elena Braynova
INFOCOM
2012
IEEE
11 years 11 months ago
Combinatorial auction with time-frequency flexibility in cognitive radio networks
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
Mo Dong, Gaofei Sun, Xinbing Wang, Qian Zhang
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
14 years 9 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
ICCAD
2006
IEEE
133views Hardware» more  ICCAD 2006»
14 years 5 months ago
Stable and compact inductance modeling of 3-D interconnect structures
Recent successful techniques for the efficient simulation of largescale interconnect models rely on the sparsification of the inverse of the inductance matrix L. While there are...
Hong Li, Venkataramanan Balakrishnan, Cheng-Kok Ko...