Sciweavers

5169 search results - page 358 / 1034
» Locality approximation using time
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
SRF: Matrix completion based on smoothed rank function
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
Hooshang Ghasemi, Mohmmadreza Malek-Mohammadi, Mas...
BILDMED
2009
123views Algorithms» more  BILDMED 2009»
15 years 7 months ago
Image Registration Using Tensor Grids for Lung Ventilation Studies
In non-parametric image registration it is often not possible to work with the original resolution of the images due to high processing times and lack of memory. However, for some ...
Heike Ruppertshofen, Sven Kabus, Bernd Fischer
DMIN
2006
141views Data Mining» more  DMIN 2006»
15 years 8 months ago
Detecting Cheats In Online Student Assessments Using Data Mining
: We can find several online assessment applications, Windows oriented or Web based, licensed or gnu free software, proprietary or standardized. All of them executing basic questio...
Genadiy Burlak, Jaime Muñoz, Alberto Ochoa,...
PARELEC
2000
IEEE
15 years 11 months ago
Sequential and Distributed Simulations Using Java Threads
The purpose of this paper consists of demonstrating an implementation methodology of sequential and distributed simulations using Java programming: two specific algorithms based o...
Mostafa Azizi, El Mostapha Aboulhamid, Sofiè...
SLP
1993
117views more  SLP 1993»
15 years 8 months ago
Boolean Constraint Solving Using clp(FD)
We present a boolean constraint logic language clp(B/FD) built upon a language over finite domains clp(FD) which uses a local propagation constraint solver. It is based on a sing...
Philippe Codognet, Daniel Diaz