|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
Results
Found 24 publication records. Showing 24 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
109 | Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff 0001 |
Facility Location and the Geometric Minimum-Diameter Spanning Tree. |
APPROX |
2002 |
DBLP DOI BibTeX RDF |
|
108 | Vladimir Nikolajevic, Gerhard P. Fettweis |
New Recursive Algorithms for the Unified Forward and Inverse MDCT/MDST. |
J. VLSI Signal Process. |
2003 |
DBLP DOI BibTeX RDF |
MDCT/MDST, IMDCT/IMDST |
87 | Beat Gfeller |
Faster Swap Edge Computation in Minimum Diameter Spanning Trees. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
87 | Naser Sedaghati-Mokhtari, Mahdi Nazm Bojnordi, Sied Mehdi Fakhraie |
MDST: Multiprocessor DSP Simulation Toolkit for Voice Processing Applications. |
MASCOTS |
2007 |
DBLP DOI BibTeX RDF |
MDST, Multiprocessor DSP Simulation toolkit, Voice processing applications |
65 | Franck Butelle, Christian Lavault, Marc Bui |
A Uniform Self-Stabilizing Minimum Diameter Tree Algorithm (Extended Abstract). |
WDAG |
1995 |
DBLP DOI BibTeX RDF |
|
64 | Vladimir Britanak |
An efficient computing of oddly stacked MDCT/MDST via evenly stacked MDCT/MDST and vice versa. |
Signal Process. |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Suleyman Uludag, Kemal Akkaya |
Distributed channel assignment in Wireless Mesh Networks with guaranteed connectivity. |
LCN |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Enrico Nardelli, Guido Proietti, Peter Widmayer |
Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures. |
ESA |
1998 |
DBLP DOI BibTeX RDF |
|
44 | Jan-Ming Ho, D. T. Lee, Chia-Hsiang Chang |
Bounded-Diameter Minimum Spanning Trees and Related Problems. |
SCG |
1989 |
DBLP DOI BibTeX RDF |
|
32 | Doru-Florin Chiper, Arcadie Cracan |
New Systolic Array Algorithms and VLSI Architectures for 1-D MDST. |
Sensors |
2023 |
DBLP DOI BibTeX RDF |
|
32 | Changlock Choi, Seong-Yun Hong |
MDST-DBSCAN: A Density-Based Clustering Method for Multidimensional Spatiotemporal Data. |
ISPRS Int. J. Geo Inf. |
2021 |
DBLP DOI BibTeX RDF |
|
32 | Vladimir Britanak |
New generalized conversion method of the MDCT to MDST coefficients in the frequency domain for arbitrary symmetric windowing function. |
Digit. Signal Process. |
2013 |
DBLP DOI BibTeX RDF |
|
32 | Shin-Chi Lai, Yi-Ping Yeh, Wen-Chieh Tseng, Sheau-Fang Lei |
Low-Cost and High-Accuracy Design of Fast Recursive MDCT/MDST/IMDCT/IMDST Algorithms and Their Realization. |
IEEE Trans. Circuits Syst. II Express Briefs |
2012 |
DBLP DOI BibTeX RDF |
|
32 | Shin-Chi Lai, Yi-Ping Yeh, Sheau-Fang Lei |
Hardware-efficient filterbank design for fast recursive MDST and IMDST algorithms. |
ISCAS |
2012 |
DBLP DOI BibTeX RDF |
|
32 | Vladimir Britanak, Huibert J. Lincklaen Arriëns |
Fast computational structures for an efficient implementation of the complete TDAC analysis/synthesis MDCT/MDST filter banks. |
Signal Process. |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Vladimir Britanak |
New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks. |
Signal Process. |
2009 |
DBLP DOI BibTeX RDF |
|
32 | K. Suresh 0001, T. V. Sreenivas |
Linear filtering in DCT IV/DST IV and MDCT/MDST domain. |
Signal Process. |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Hadas Ofir, David Malah, Israel Cohen |
Audio Packet Loss Concealment in a Combined MDCT-MDST Domain. |
IEEE Signal Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Vladimir Britanak |
A Note on the MDCT/MDST and Pseudoinverse Matrix. |
Comput. Artif. Intell. |
2004 |
DBLP BibTeX RDF |
|
32 | Vladimir Britanak, Kamisetty Ramamohan Rao |
A new fast algorithm for the unified forward and inverse MDCT/MDST computation. |
Signal Process. |
2002 |
DBLP DOI BibTeX RDF |
|
22 | Dae-Young Seo, D. T. Lee, Tien-Ching Lin |
Geometric Minimum Diameter Minimum Cost Spanning Tree Problem. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis |
Self-stabilizing minimum-degree spanning tree within one from the optimal degree. |
IPDPS |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Pierre Fraigniaud |
Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode. |
ESA |
2001 |
DBLP DOI BibTeX RDF |
Minimum Degree Spanning Tree, Approximation Algorithms, Multicasting, Broadcasting, Gossiping, Graph and Network Algorithms |
22 | Francisco José Alfaro, Aurelio Bermúdez, Rafael Casado, José Duato, Francisco J. Quiles 0001, José L. Sánchez 0002 |
On the Performance of Up*/Down* Routing. |
CANPC |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #24 of 24 (100 per page; Change: )
|
|