Sciweavers

461 search results - page 91 / 93
» Fundamentals of concern manipulation
Sort
View
MST
2007
167views more  MST 2007»
13 years 7 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
JOCN
2010
70views more  JOCN 2010»
13 years 6 months ago
Optimizing Design Efficiency of Free Recall Events for fMRI
■ Free recall is a fundamental paradigm for studying memory retrieval in the context of minimal cue support. Accordingly, free recall has been extensively studied using behavior...
Ilke Öztekin, Nicole M. Long, David Badre
PAISI
2010
Springer
13 years 5 months ago
Efficient Privacy Preserving K-Means Clustering
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
BIRTHDAY
2010
Springer
13 years 4 months ago
Database Theory, Yuri, and Me
Yuri Gurevich made many varied and deep contributions to logic for computer science. Logic provides also the theoretical foundation of database systems. Hence, it is almost unavoid...
Jan Van den Bussche
BMCBI
2011
13 years 2 months ago
A quality metric for homology modeling: the H-factor
Background: The analysis of protein structures provides fundamental insight into most biochemical functions and consequently into the cause and possible treatment of diseases. As ...
Eric di Luccio, Patrice Koehl