Sciweavers

11211 search results - page 395 / 2243
» Rank-Sensitive Data Structures
Sort
View
IPL
2008
118views more  IPL 2008»
15 years 6 months ago
Slicing for modern program structures: a theory for eliminating irrelevant loops
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
Torben Amtoft
TCBB
2008
108views more  TCBB 2008»
15 years 6 months ago
Statistical Characterization of Protein Ensembles
When accounting for structural fluctuations or measurement errors, a single rigid structure may not be sufficient to represent a protein. One approach to solve this problem is to r...
Diego Rother, Guillermo Sapiro, Vijay Pande
CIKM
2010
Springer
15 years 5 months ago
Evaluating, combining and generalizing recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
Aditya G. Parameswaran, Hector Garcia-Molina, Jeff...
CSDA
2010
100views more  CSDA 2010»
15 years 5 months ago
Least squares estimation of nonlinear spatial trends
The goal of this work is to study the asymptotic and finite sample properties of an estimator of a nonlinear regression function when errors are spatially correlated, and when the...
Rosa M. Crujeiras, Ingrid Van Keilegom
ICANN
2010
Springer
15 years 5 months ago
Dynamic Shape Learning and Forgetting
In this paper, we present a system capable of dynamically learning shapes in a way that also allows for the dynamic deletion of shapes already learned. It uses a self-balancing Bin...
Nikolaos Tsapanos, Anastasios Tefas, Ioannis Pitas