Search alternatives:
coding algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search), scheduling algorithm (Expand Search)
experiments b » experimental _ (Expand Search)
ii algorithm » rd algorithm (Expand Search), _ algorithms (Expand Search)
b algorithm » _ algorithms (Expand Search), rd algorithm (Expand Search)
coding algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search), scheduling algorithm (Expand Search)
experiments b » experimental _ (Expand Search)
ii algorithm » rd algorithm (Expand Search), _ algorithms (Expand Search)
b algorithm » _ algorithms (Expand Search), rd algorithm (Expand Search)
-
21
-
22
A novel technique for fast multiplication
Published 2020“…These partial products are then added using a tree of carry-save-adders, and ® nally the sum and carry vectors are added using a carry-lookahead adder. In the case of 2 s complement multiplication the tree of carry-save-adders also receives a correction output produced in parallel with the partial products. …”
Get full text
article -
23
PERF solutions for distributed query optimization. (c1999)
Published 1999Get full text
Get full text
masterThesis -
24
A novel technique for fast multiplication
Published 1995“…These partial products are then added using a tree of carry-save-adders, and finally the sum and carry vectors are added using a carry-look-ahead adder. In case of 2's complement multiplication the tree of carry-save-adders also receives a correction output produced in parallel with the partial products. …”
Get full text
Get full text
article -
25
Anonymizing multimedia documents
Published 2016Get full text
Get full text
Get full text
Get full text
article -
26
De-Linkability
Published 2013Get full text
Get full text
Get full text
Get full text
conferenceObject -
27
A new approach and faster exact methods for the maximum common subgraph problem
Published 2017“…This structure contains a large number of naturally-ordered cliques that are present in the association graph’s complement. A detailed analysis shows that the proposed algorithm requires O((m+1)n) time, which is a superior worst-case bound to those known for previously-analyzed algorithms in the setting of the MCS problem. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
28
Query acceleration in distributed database systems
Published 2001Get full text
Get full text
Get full text
article -
29
Efficient Seismic Volume Compression using the Lifting Scheme
Published 2000“…Finally a runlength plus a Huffman encoding are applied for binary coding of the quantized coefficients.…”
Get full text
article -
30
Developing a Cooperative Behavior for Multi Agents System Application to Robot Soccer
Published 2007Get full text
doctoralThesis -
31
Multigrid solvers in reconfigurable hardware. (c2006)
Published 2006Get full text
Get full text
masterThesis -
32
Downlink channel estimation for IMT-DS
Published 2001“…To obtain channel estimates during pilot symbols, we propose a chip level adaptive channel estimation which performs better than the conventional method. …”
Get full text
Get full text
article -
33
(k, l)-Clustering for Transactional Data Streams Anonymization
Published 2018Get full text
Get full text
Get full text
Get full text
conferenceObject -
34
Central schemes for ideal magnetohydrodynamics
Published 2007“…These methods alternate between two staggered grids, thus leading to Riemann solver‐free algorithms with relatively favorable computing times. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
35
Measuring ripple effect for object-oriented programs. (c2004)
Published 2004Get full text
Get full text
masterThesis -
36
Regression Testing of Database Applications
Published 2002Get full text
Get full text
Get full text
article -
37
Finite volume central schemes for three-dimensional ideal MHD
Published 2008“…These methods alternate between two staggered grids, thus leading to Riemann solver-free algorithms with relatively favorable computing times. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
38
Approximate XML structure validation technical report
Published 2014Get full text
Get full text
Get full text
article -
39
Spectral energy balancing system with massive MIMO based hybrid beam forming for wireless 6G communication using dual deep learning model
Published 2024“…The performance level improvements are practically summarized in both the transmission and reception entities with the help of the proposed hybrid network architecture and the associated Dual Deep Network algorithm. …”
-
40