Sciweavers

6110 search results - page 60 / 1222
» Approximate Computing
Sort
View
WINE
2007
Springer
151views Economy» more  WINE 2007»
16 years 3 days ago
Computing Optimal Bundles for Sponsored Search
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararaja...
COLT
2000
Springer
15 years 10 months ago
The Computational Complexity of Densest Region Detection
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon
CPHYSICS
2011
232views Education» more  CPHYSICS 2011»
15 years 1 months ago
A nested Krylov subspace method to compute the sign function of large complex matrices
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the o...
Jacques Bloch, Simon Heybrock
BIOINFORMATICS
2012
13 years 8 months ago
Approximate probabilistic analysis of biopathway dynamics
Bing Liu 0013, Andrei Hagiescu, Sucheendra K. Pala...
ESA
2011
Springer
252views Algorithms» more  ESA 2011»
14 years 5 months ago
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane
Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in R2 . These include Tukey depth [15], O...
Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir