Sciweavers

2080 search results - page 223 / 416
» Measuring empirical computational complexity
Sort
View
BMCBI
2008
87views more  BMCBI 2008»
15 years 6 months ago
Volume-based solvation models out-perform area-based models in combined studies of wild-type and mutated protein-protein interfa
Background: Empirical binding models have previously been investigated for the energetics of protein complexation (G models) and for the influence of mutations on complexation (i....
Salim Bougouffa, Jim Warwicker
PROPERTYTESTING
2010
15 years 3 months ago
Sublinear Algorithms in the External Memory Model
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...
TAMC
2007
Springer
16 years 13 hour ago
Improving the Average Delay of Sorting
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Re...
CGF
2008
75views more  CGF 2008»
15 years 6 months ago
Extraction Of Feature Lines On Surface Meshes Based On Discrete Morse Theory
We present an approach for extracting extremal feature lines of scalar indicators on surface meshes, based on discrete Morse Theory. By computing initial Morse-Smale complexes of ...
Jan Sahner, Britta Weber, Steffen Prohaska, Hans L...
WWW
2009
ACM
16 years 6 months ago
How much can behavioral targeting help online advertising?
Behavioral Targeting (BT) is a technique used by online advertisers to increase the effectiveness of their campaigns, and is playing an increasingly important role in the online a...
Jun Yan, Ning Liu, Gang Wang, Wen Zhang, Yun Jiang...