Sciweavers

9871 search results - page 56 / 1975
» On the Structure of Low Sets
Sort
View
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
14 years 9 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
ECOOP
2010
Springer
14 years 1 months ago
A Type System for Data-Centric Synchronization
Data-centric synchronization groups fields of objects into atomic sets to indicate they must be updated atomically. Each atomic set has associated units of work, code fragments th...
Mandana Vaziri, Frank Tip, Julian Dolby, Christian...
APAL
2010
85views more  APAL 2010»
13 years 9 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
BMCBI
2007
102views more  BMCBI 2007»
13 years 9 months ago
Setting up a large set of protein-ligand PDB complexes for the development and validation of knowledge-based docking algorithms
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
Luis A. Diago, Persy Morell, Longendri Aguilera, E...
CVPR
2007
IEEE
14 years 11 months ago
Modeling Appearances with Low-Rank SVM
Several authors have noticed that the common representation of images as vectors is sub-optimal. The process of vectorization eliminates spatial relations between some of the near...
Lior Wolf, Hueihan Jhuang, Tamir Hazan