Sciweavers

1132 search results - page 23 / 227
» Structural Average Case Complexity
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
LSSC
2005
Springer
14 years 2 months ago
On Weighted Structured Total Least Squares
In this contribution we extend our previous results on the structured total least squares problem to the case of weighted cost functions. It is shown that the computational complex...
Ivan Markovsky, Sabine Van Huffel
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 8 months ago
Automatic Verification of Parametric Specifications with Complex Topologies
The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally. For specifica...
Johannes Faber, Carsten Ihlemann, Swen Jacobs, Vio...
BMCBI
2010
104views more  BMCBI 2010»
13 years 8 months ago
Analysis of protein-protein docking decoys using interaction fingerprints: application to the reconstruction of CaM-ligand compl
Background: Protein-protein docking for proteins with large conformational changes was analyzed by using interaction fingerprints, one of the scales for measuring similarities amo...
Nobuyuki Uchikoga, Takatsugu Hirokawa
CLUSTER
2005
IEEE
14 years 2 months ago
A Case for Cooperative and Incentive-Based Coupling of Distributed Clusters
Interest in Grid computing has grown significantly over the past five years. Management of distributed cluster resources is a key issue in Grid computing. Central to management ...
Rajiv Ranjan, Rajkumar Buyya, Aaron Harwood