| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 3 | Fredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil |
A Self-stabilizing -Approximation Algorithm for the Maximum Matching Problem.  |
SSS  |
2008 |
DBLP DOI BibTeX RDF |
Approximation, Maximum matching, Self-stabilizing algorithm |
| 3 | Liyi Zhang, Yazi Li, Jian Meng |
Design of Chinese Word Segmentation System Based on Improved Chinese Converse Dictionary and Reverse Maximum Matching Algorithm. |
WISE Workshops |
2006 |
DBLP DOI BibTeX RDF |
Converse Chinese dictionary, reverse maximum matching algorithm, Chinese word segmentation |
| 3 | Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee |
Parallel algorithms for maximum matching in interval graphs. (PDF / PS) |
IPPS |
1995 |
DBLP DOI BibTeX RDF |
disjoint intervals, maximum cardinality matchings, hypercube model, unsorted input, sorted input, optimal sequential algorithms, parallel algorithms, parallel algorithms, computational complexity, graph theory, hypercube networks, processors, computation time, interval graphs, maximum matching, EREW PRAM, EREW PRAM model |
| 2 | Saran Krishnaswamy |
Maximum Matching in a Partially Matched Bipartite Graph and Its Applications. |
CICSyN |
2010 |
DBLP DOI BibTeX RDF |
alternating path, augmenting path, B-graph, A-path, 2N Soft-fail Redundancy, graph, maximum matching, bipartite, matching problem |
| 2 | Rachid Hadid, Mehmet Hakan Karaata |
Stabilizing maximum matching in bipartite networks. |
Computing |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68W15, 68R10, 05C85 |
| 2 | Yuichi Yoshida, Masaki Yamamoto, Hiro Ito |
An improved constant-time approximation algorithm for maximum~matchings. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
constant-time approximation algorithms, minimum vertex cover, property testing, maximum matching, minimum set cover |
| 2 | Raphael Yuster, Uri Zwick |
Maximum matching in graphs with an excluded minor. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Zvi Lotker, Boaz Patt-Shamir, Adi Rosén |
Distributed approximate matching. |
PODC |
2007 |
DBLP DOI BibTeX RDF |
distributed algorithms, graph algorithms, dynamic algorithms, maximum matching, distributed approximation algorithms |
| 2 | Carmit Hazay, Moshe Lewenstein, Dina Sokol |
Approximate parameterized matching. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
mismatch pair, parameterize match, Hamming distance, maximum matching |
| 2 | Minghua Zhang, Shensheng Zhang |
An Accurate and Fast WLAN User Location Estimation Method Based on Received Signal Strength. |
International Conference on Computational Science |
2007 |
DBLP DOI BibTeX RDF |
User location estimation, Location estimation speed, Wireless local area network, Maximum matching, Received signal strength |
| 2 | Depeng Li, Srinivas Sampalli |
An efficient group key establishment in location-aided mobile ad hoc networks. |
PE-WASUN |
2005 |
DBLP DOI BibTeX RDF |
key tree, group key management, maximum matching |
| 2 | Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska |
A Fast Distributed Algorithm for Approximating the Maximum Matching. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Oliver Giel, Ingo Wegener |
Evolutionary Algorithms and the Maximum Matching Problem. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 2 | José Soares, Marco A. Stefanes |
BSP/CGM Algorithm for Maximum Matching in Convex Bipartite Graphs. |
SBAC-PAD |
2003 |
DBLP DOI BibTeX RDF |
|
| 2 | Andrzej Czygrinow, Michal Hanckowiak |
Distributed Algorithm for Better Approximation of the Maximum Matching. |
COCOON |
2003 |
DBLP DOI BibTeX RDF |
|
| 2 | Zhenghao Zhang, Yuanyuan Yang |
Distributed Scheduling Algorithms for Wavelength Convertible WDM Optical Interconnects. |
IPDPS |
2003 |
DBLP DOI BibTeX RDF |
convex bipartite graph, contention-free, distributed algorithms, scheduling algorithms, optical interconnects, Wavelength-division-multiplexing (WDM), optical switches, wavelength conversion, maximum matching, limited range wavelength conversion |
| 2 | Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne, Markus Latzel |
Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs. (PDF / PS) |
IPPS/SPDP |
1999 |
DBLP DOI BibTeX RDF |
|
| 2 | Yoojin Chung, Kunsoo Park, Yookun Cho |
Parallel Maximum Matching Algorithms in Interval Graphs. (PDF / PS) |
ICPADS |
1997 |
DBLP DOI BibTeX RDF |
|
| 2 | Mostafa H. Abd-El-Barr, M. N. Hasan, G. A. Hamid |
On the Synthesis of MVL Functions Using Input and Output Phase Assignments. (PDF / PS) |
ISMVL |
1997 |
DBLP DOI BibTeX RDF |
MVL functions synthesis, phase assignments, decomposition based mapping, input matrix, output matrix, matching-count matrix, output function number, maximum matching count, switching operations, switching operators, r-valued functions, logic synthesis, minimization, multivalued logic |
| 2 | Maw-Shang Chang |
Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite Graphs. |
ISAAC |
1996 |
DBLP DOI BibTeX RDF |
|
| 2 | Norbert Blum |
A New Approach to Maximum Matching in General Graphs. |
ICALP |
1990 |
DBLP DOI BibTeX RDF |
|
| 2 | Harold N. Gabow |
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs. |
J. ACM |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Fredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil |
A self-stabilizing 2/3-approximation algorithm for the maximum matching problem. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kook Jin Ahn, Sudipto Guha |
Laminar Families and Metric Embeddings: Non-bipartite Maximum Matching Problem in the Semi-Streaming Model |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Christian Konrad, Frédéric Magniez, Claire Mathieu |
Maximum Matching in Semi-Streaming with Few Passes |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kook Jin Ahn, Sudipto Guha |
Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kook Jin Ahn, Sudipto Guha |
Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Picouleau |
A note on a conjecture on maximum matching in almost regular graphs. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Prasad Chebolu, Alan M. Frieze, Páll Melsted |
Finding a maximum matching in a sparse random graph in O(n) expected time. |
J. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathieu Liedloff, Ioan Todinca, Yngve Villanger |
Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Krzysztof Onak, Ronitt Rubinfeld |
Dynamic Approximate Vertex Cover and Maximum Matching. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shumin Zhou, Bin Tang, Wen Li |
The Study of Address Tree Coding Based on the Maximum Matching Algorithm in Courier Business. |
CETS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Krzysztof Onak, Ronitt Rubinfeld |
Maintaining a large matching and a small vertex cover. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
data structures, vertex cover, dynamic algorithms, maximum matching |
| 1 | Francesco Carrabs, Raffaele Cerulli, Monica Gentili |
The labeled maximum matching problem. |
Computers & OR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Manoj Gupta 0002, Ankit Sharma |
An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Artur Khojabaghyan, Vahan V. Mkrtchyan |
An upper bound for a parameter related to special maximum matching constructing |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks |
On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology. |
SIROCCO |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska |
Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Claire Mathieu, Alistair Sinclair |
Sherali-adams relaxations of the matching polytope. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
0-1 programming, matching polytope, maximum matching, linear programming relaxation, integrality gap, lift-and-project |
| 1 | Ying Tan, Lan Huang, Hong Qi, Yandong Zhai |
Design and Implementation of Chinese Text Clustering System. |
NCM |
2009 |
DBLP DOI BibTeX RDF |
Chinese text clustering, reverse maximum matching, text mining, K-means algorithm, Chinese word segmentation |
| 1 | Jianer Chen |
Maximum Partition Matching. |
Encyclopedia of Optimization |
2009 |
DBLP DOI BibTeX RDF |
Parallel routing algorithm, Greedy algorithm, Maximum matching, Star network |
| 1 | Zhenjiang Lin, Michael R. Lyu, Irwin King |
MatchSim: a novel neighbor-based similarity measure with maximum neighborhood matching. |
CIKM |
2009 |
DBLP DOI BibTeX RDF |
web mining, similarity measure, graph algorithm, link analysis |
| 1 | Gaurav S. Kasbekar, Saswati Sarkar |
Spectrum auction framework for access allocation in cognitive radio networks. |
MobiHoc |
2009 |
DBLP DOI BibTeX RDF |
spectrum auctions, algorithms, cognitive radio networks |
| 1 | Xiaoying Sha, Xiaobai Liu, Jianting Wen |
Foreground classification using active template in the scene context for visual surveillance. |
SAC |
2009 |
DBLP DOI BibTeX RDF |
scene context, visual surveillance, target recognition |
| 1 | Adrian Dumitrescu, Csaba D. Tóth, Guangwu Xu |
On stars and Steiner stars: II. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hazem El-Alfy, David Jacobs, Larry Davis |
Assigning cameras to subjects in video surveillance systems. |
ICRA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pang Baomao, Shi Haoshan |
Research on Improved Algorithm for Chinese Word Segmentation Based on Markov Chain. |
IAS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhenghao Zhang, Yuanyuan Yang, Miao Zhao |
Enhancing Downlink Performance in Wireless Networks by Simultaneous Multiple Packet Transmission. |
IEEE Trans. Computers |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim E. Levit, Eugen Mandrescu |
On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph. |
Graph Theory, Computational Intelligence and Thought |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan |
Maximum Bipartite Flow in Networks with Adaptive Channel Width. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Cheng Wang, Wenyuan Yu, Wenxin Li, Zhuoqun Xu |
A Novel Method of Automobiles' Chinese Nickname Recognition. |
ICCPOL |
2009 |
DBLP DOI BibTeX RDF |
nickname recognition, named entity, Automobile |
| 1 | Michael R. Fellows, Jiong Guo, Iyad A. Kanj |
The Parameterized Complexity of Some Minimum Label Problems. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Dörn |
Quantum Algorithms for Matching Problems. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Graph theory, Quantum algorithms, Matching problems |
| 1 | Ju Wang, Jonathan C. L. Liu |
Uplink relaying in hybrid wireless networks with out-of-cell interference reduction. |
Wireless Networks |
2009 |
DBLP DOI BibTeX RDF |
Uplink relaying, Out-cell-interference, Wireless network, WLAN, WCDMA, Vertex cover |
| 1 | Eunhui Park, Kunsoo Park |
An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph. |
Fundam. Inform. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Marcin Mucha |
Maximum Matching. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Prasad Chebolu, Alan M. Frieze, Páll Melsted |
Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Sankowski |
Processor Efficient Parallel Matching. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
RNC algorithm, Parallel algorithms, Maximum matching, Fast matrix multiplication |
| 1 | Kanad Basu, Prabhat Mishra |
A novel test-data compression technique using application-aware bitmask and dictionary selection methods. |
ACM Great Lakes Symposium on VLSI |
2008 |
DBLP DOI BibTeX RDF |
compression, test data, decompression |
| 1 | Adrian Dumitrescu, Csaba D. Tóth |
On stars and Steiner stars. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Shaohua Jiang, Yanzhong Dang |
Automatic Segmentation of Hierarchy Feature without Lexicon for Chinese Text Based on Iterative Learning. |
CSSE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Huy N. Nguyen, Krzysztof Onak |
Constant-Time Approximation Algorithms via Local Improvements. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Panlong Yang, Guihai Chen |
FAST CASH: FAir and STable Channel ASsignment on Heterogeneous Wireless Mesh Network. |
ICYCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Wiese, Evangelos Kranakis |
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs. |
ADHOC-NOW |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
König Deletion Sets and Vertex Covers above the Matching Size. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Sankowski |
Algebraic Graph Algorithms. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu |
On the Approximability of Comparing Genomes with Duplicates. |
WALCOM |
2008 |
DBLP DOI BibTeX RDF |
conserved intervals, genome rearrangement, duplicates, breakpoints, adjacencies, common intervals, APX-Hardness |
| 1 | Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak |
Fast Distributed Approximations in Planar Graphs. |
DISC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhi-Zhong Chen |
Approximation Algorithms for Bounded Degree Phylogenetic Roots. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Phylogenetic roots, Approximation algorithms, Randomized algorithms, Graph algorithms, Computational biology, Phylogenies |
| 1 | Marios Mavronicolas, Vicky Papadopoulou, Anna Philippou, Paul G. Spirakis |
A Network Game with Attackers and a Defender. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Attacks and defenses, Security, Game theory, Graph theory, Nash equilibria |
| 1 | Maria Chudnovsky, William H. Cunningham, Jim Geelen |
An algorithm for packing non-zero A -paths in group-labelled graphs. |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05C22 |
| 1 | Michael A. Henning, Anders Yeo |
Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph. |
Graphs and Combinatorics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vahan V. Mkrtchyan |
On trees with a maximum proper partial 0-1 coloring containing a maximum matching |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Rafael R. Kamalian, Vahan V. Mkrtchyan |
Two polynomial algorithms for special maximum matching constructing in trees |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Fredrik Manne, Rob H. Bisseling |
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem. |
PPAM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Chayant Tantipathananandh, Tanya Y. Berger-Wolf, David Kempe |
A framework for community identification in dynamic social networks. |
KDD |
2007 |
DBLP DOI BibTeX RDF |
community identification, dynamic social networks |
| 1 | Meng-Shiuan Pan, Yu-Chee Tseng |
The orphan problem in zigbee-based wireless sensor networks. |
MSWiM |
2007 |
DBLP DOI BibTeX RDF |
orphan problem, wireless sensor network, graph theory, zigbee, ieee 802.15.4 |
| 1 | Piotr Sankowski |
Faster dynamic matchings and vertex connectivity. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | You-Chiun Wang, Wen-Chih Peng, Min-Hsien Chang, Yu-Chee Tseng |
Exploring Load-Balance to Dispatch Mobile Sensors in Wireless Sensor Networks. |
ICCCN |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Myung Ah Park, Andras Farago |
Minimum Frequencies for the Virtual Maximum MAC Capacity in a Multichannel Ad-Hoc Network. |
LCN |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiyan Hu, Charles J. Alpert, Jiang Hu, Shrirang K. Karandikar, Zhuo Li, Weiping Shi, Chin-Ngai Sze |
Fast Algorithms for Slew-Constrained Minimum Cost Buffering. |
IEEE Trans. on CAD of Integrated Circuits and Systems |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson, Thomas F. La Porta, Ou Liu, Hosam Rowaihy |
Assigning Sensors to Missions with Demands. |
ALGOSENSORS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Almost Exact Matchings. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Czygrinow, Michal Hanckowiak |
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families. |
COCOON |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Raphael Yuster |
Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Márton Makai, Gyula Pap, Jácint Szabó |
Matching Problems in Polymatroids Without Double Circuits. |
IPCO |
2007 |
DBLP DOI BibTeX RDF |
matroids and submodular functions |
| 1 | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian |
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel |
Dynamic Matchings in Convex Bipartite Graphs. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Nomikos, Aris Pagourtzis, Stathis Zachos |
Randomized and Approximation Algorithms for Blue-Red Matching. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette |
A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. |
RECOMB-CG |
2007 |
DBLP DOI BibTeX RDF |
breakpoint distance, heuristic, genome rearrangement, duplication, pseudo-boolean programming |
| 1 | Qizhi Fang, Liang Kong |
Core Stability of Vertex Cover Games. |
WINE |
2007 |
DBLP DOI BibTeX RDF |
Vertex cover game, stable core, largeness, exactness, balanced, extendability |
| 1 | Vahan V. Mkrtchyan |
On trees with a maximum proper partial 0-1 coloring containing a maximum matching. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yitzhak Birk, Tomer Kol |
Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients. |
IEEE Transactions on Information Theory |
2006 |
DBLP DOI BibTeX RDF |
k-partial clique, caching clients, clique cover, informed-Source Coding On Demand (ISCOD), multicast, error-correcting codes, communication complexity, information dissemination, maximum matching |
| 1 | Marcin Mucha, Piotr Sankowski |
Maximum Matchings in Planar Graphs via Gaussian Elimination. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Planar graphs, Maximum matching, Fast matrix multiplication |
| 1 | Oliver Giel, Ingo Wegener |
Maximum cardinality matchings on trees by randomized local search. |
GECCO |
2006 |
DBLP DOI BibTeX RDF |
maximum cardinality matchings, randomized local search, evolutionary algorithms, runtime analysis |
| 1 | Zoë Abrams, Ho-Lin Chen, Leonidas J. Guibas, Jie Liu, Feng Zhao |
Kinetically stable task assignment for networks of microservers. |
IPSN |
2006 |
DBLP DOI BibTeX RDF |
matchings, stochastic processes |
| 1 | Raymond R. Hoare, Zhu Ding, Alex K. Jones |
Interconnect routing and scheduling - A near-optimal real-time hardware scheduler for large cardinality crossbar switches. |
SC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Martin Milanic |
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
polynomial-time algorithm, independent set |
| 1 | Asaad Hakeem, Roberto Vezzani, Mubarak Shah, Rita Cucchiara |
Estimating Geospatial Trajectory of a Moving Camera. |
ICPR |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhenghao Zhang, Yuanyuan Yang |
Enhancing downlink performance in wireless networks by simultaneous multiple packet transmission. |
IPDPS |
2006 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")