Sciweavers

184 search results - page 28 / 37
» Using FPGAs to solve the Hamiltonian cycle problem
Sort
View
ICISP
2010
Springer
15 years 3 months ago
Total Variation Minimization with Separable Sensing Operator
Compressed Imaging is the theory that studies the problem of image recovery from an under-determined system of linear measurements. One of the most popular methods in this field i...
Serge L. Shishkin, Hongcheng Wang, Gregory S. Hage...
79
Voted
CASES
2009
ACM
15 years 6 months ago
Optimal loop parallelization for maximizing iteration-level parallelism
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
Duo Liu, Zili Shao, Meng Wang, Minyi Guo, Jingling...
84
Voted
CCIA
2007
Springer
15 years 3 months ago
Assessing Confidence in Cased Based Reuse Step
Case-Based Reasoning (CBR) is a learning approach that solves current situations by reusing previous solutions that are stored in a case base. In the CBR cycle the reuse step plays...
F. Alejandro García, Javier Orozco, Jordi G...
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
14 years 11 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
ICDE
1998
IEEE
270views Database» more  ICDE 1998»
16 years 1 months ago
Cyclic Association Rules
We study the problem of discovering association rules that display regular cyclic variation over time. For example, if we compute association rules over monthly sales data, we may...
Banu Özden, Sridhar Ramaswamy, Abraham Silber...