Sciweavers

4156 search results - page 706 / 832
» Modeling and simulation of retrieving process
Sort
View
PPL
2007
86views more  PPL 2007»
14 years 9 months ago
Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...
Chryssis Georgiou, Alexander Russell, Alexander A....
ICA
2004
Springer
15 years 3 months ago
Postnonlinear Overcomplete Blind Source Separation Using Sparse Sources
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
Fabian J. Theis, Shun-ichi Amari
PATAT
2004
Springer
130views Education» more  PATAT 2004»
15 years 3 months ago
Learning User Preferences in Distributed Calendar Scheduling
Abstract. Within the field of software agents, there has been increasing interest in automating the process of calendar scheduling in recent years. Calendar (or meeting) schedulin...
Jean Oh, Stephen F. Smith
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 4 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
CONTEXT
2007
Springer
15 years 4 months ago
Discovering Hidden Contextual Factors for Implicit Feedback
Abstract. This paper presents a statistical framework based on Principal Component Analysis (PCA) for discovering the contextual factors which most strongly influence user behavio...
Massimo Melucci, Ryen W. White