Sciweavers

1408 search results - page 239 / 282
» Dynamical Tensor Approximation
Sort
View
JAIR
2010
145views more  JAIR 2010»
14 years 8 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
JPDC
2010
106views more  JPDC 2010»
14 years 8 months ago
Feedback-directed page placement for ccNUMA via hardware-generated memory traces
Non-uniform memory architectures with cache coherence (ccNUMA) are becoming increasingly common, not just for large-scale high performance platforms but also in the context of mul...
Jaydeep Marathe, Vivek Thakkar, Frank Mueller
PKDD
2010
Springer
150views Data Mining» more  PKDD 2010»
14 years 8 months ago
Virus Propagation on Time-Varying Networks: Theory and Immunization Algorithms
Given a contact network that changes over time (say, day vs night connectivity), and the SIS (susceptible/infected/susceptible, flu like) virus propagation model, what can we say ...
B. Aditya Prakash, Hanghang Tong, Nicholas Valler,...
SISAP
2010
IEEE
159views Data Mining» more  SISAP 2010»
14 years 8 months ago
CP-index: using clustering and pivots for indexing non-metric spaces
Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
Victor Sepulveda, Benjamin Bustos
SPIRE
2010
Springer
14 years 8 months ago
Restricted LCS
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe...