Sciweavers

4325 search results - page 865 / 865
» Incremental computation with names
Sort
View
COMPGEOM
2010
ACM
13 years 10 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
BMCBI
2007
127views more  BMCBI 2007»
13 years 5 months ago
Predicting the phenotypic effects of non-synonymous single nucleotide polymorphisms based on support vector machines
Background: Human genetic variations primarily result from single nucleotide polymorphisms (SNPs) that occur approximately every 1000 bases in the overall human population. The no...
Jian Tian, Ningfeng Wu, Xuexia Guo, Jun Guo, Juhua...
BMCBI
2007
144views more  BMCBI 2007»
13 years 5 months ago
InPrePPI: an integrated evaluation method based on genomic context for predicting protein-protein interactions in prokaryotic ge
Background: Although many genomic features have been used in the prediction of proteinprotein interactions (PPIs), frequently only one is used in a computational method. After rea...
Jingchun Sun, Yan Sun, Guohui Ding, Qi Liu, Chuan ...
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
11 years 7 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo

Publication
303views
12 years 3 months ago
Evolutionary synthesis of analog networks
he significant increase in the available computational power that took place in recent decades has been accompanied by a growing interest in the application of the evolutionary ap...
Claudio Mattiussi