2152 search results - page 283 / 431 » A Comparative Study of 2QBF Algorithms |
130
click to vote
CIKM
2007
Springer
15 years 11 months ago
2007
Springer
We study the parallelization of the (record) linkage problem – i.e., to identify matching records between two collections of records, A and B. One of main idiosyncrasies of the ...
182
click to vote
ADC
2003
Springer
15 years 10 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
131
click to vote
ICPR
2006
IEEE
16 years 6 months ago
2006
IEEE
This paper presents a comparative study of robust diffusion algorithms when used for smoothing structural fields applied in volumetric image interpolation. The input data consists...
229
click to vote
VLDB
2005
ACM
16 years 5 months ago
2005
ACM
Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, t...
156
Voted
VTC
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—Cross-layer routing and scheduling algorithms design for wireless backhaul mesh network has attracted much research interest recently. The network is expected to support...