Sciweavers

3894 search results - page 767 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
BMCBI
2008
144views more  BMCBI 2008»
13 years 6 months ago
Pep-3D-Search: a method for B-cell epitope prediction based on mimotope analysis
Background: The prediction of conformational B-cell epitopes is one of the most important goals in immunoinformatics. The solution to this problem, even if approximate, would help...
Yanxin Huang, Yongli Bao, Shu Yan Guo, Yan Wang, C...
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 6 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ECCC
2007
86views more  ECCC 2007»
13 years 6 months ago
Testing Halfspaces
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, R...
ML
2006
ACM
13 years 6 months ago
Universal parameter optimisation in games based on SPSA
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
Levente Kocsis, Csaba Szepesvári
CPHYSICS
2004
87views more  CPHYSICS 2004»
13 years 6 months ago
Vlasov simulations on an adaptive phase-space grid
We introduce here a new method for the numerical resolution of the Vlasov equation on a phase space grid using an adaptive semi-Lagrangian method. The adaptivity is obtained throu...
Michael Gutnic, Matthieu Haefele, I. Paun, Eric So...