Sciweavers

3038 search results - page 100 / 608
» High-Speed Function Approximation
Sort
View
JCO
1998
102views more  JCO 1998»
15 years 2 months ago
Facility Location with Dynamic Distance Functions
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...
Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram...
SCAM
2007
IEEE
15 years 8 months ago
Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes
To encourage open source/libre software development, it is desirable to have tools that can help to identify open source license violations. This paper describes the implementatio...
Arnoldo José Müller Molina, Takeshi Sh...
131
Voted
ARITH
2009
IEEE
15 years 9 months ago
Fast and Accurate Bessel Function Computation
The Bessel functions are considered relatively difficult to compute. Although they have a simple power series expansion that is everywhere convergent, they exhibit approximately ...
John Harrison
EMNLP
2006
15 years 3 months ago
Random Indexing using Statistical Weight Functions
Random Indexing is a vector space technique that provides an efficient and scalable approximation to distributional similarity problems. We present experiments showing Random Inde...
James Gorman, James R. Curran
63
Voted
ICASSP
2011
IEEE
14 years 6 months ago
On synthesizing cross ambiguity functions
The cross ambiguity function (CAF) arises in many areas such as radar/sonar and communications when correlation processing is performed in the presence of a Doppler frequency shif...
Hao He, Petre Stoica, Jian Li