|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 32 occurrences of 26 keywords
|
|
|
|
|
Results
Found 23 publication records. Showing 23 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 3 | Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger |
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem.  |
Recent Advances in Evolutionary Computation for Combinatorial Optimization  |
2008 |
DBLP DOI BibTeX RDF |
Knapsack Constrained Maximum Spanning Tree, Lagrangian Decomposition, Volume Algorithm, Evolutionary Algorithm, Local Search, Hybrid Approach |
| 3 | Qiang He, Chee-Hung Henry Chu |
A New Image Segmentation Technique Using Maximum Spanning Tree.  |
IWCIA  |
2008 |
DBLP DOI BibTeX RDF |
affinity matrix, image segmentation, maximum spanning tree |
| 2 | Yifeng Zeng, Jorge Cordero Hernandez, Shuyuan Lin |
Spanning Tree Based Attribute Clustering.  |
PAKDD  |
2009 |
DBLP DOI BibTeX RDF |
Clustering, Maximum Spanning Tree |
| 2 | Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger |
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem.  |
EvoCOP  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Václav Novák, Zdenek Zabokrtský |
Feature Engineering in Maximum Spanning Tree Dependency Parser.  |
TSD  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Ramesh Nallapati, James Allan |
Capturing term dependencies using a language model based on sentence trees.  |
CIKM  |
2002 |
DBLP DOI BibTeX RDF |
story link detection, tracking, dependencies, language modeling, topic detection, co-occurrences, probabilistic approaches, sentences, maximum spanning tree |
| 2 | Jeonghun Cho, Yunheung Paek, David B. Whalley |
Efficient register and memory assignment for non-orthogonal architectures via graph coloring and MST algorithms.  |
LCTES-SCOPES  |
2002 |
DBLP DOI BibTeX RDF |
dual memory, memory assignment, non-orthogonal architecture, compiler, graph coloring, maximum spanning tree |
| 1 | S. Padma, Ananthi Seshasaayee |
Towards Maximum Spanning Tree Model in Web 3.0 Design and Development for Students using Discriminant Analysis  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Xiaoxin Yin, Sarthak Shah |
Building taxonomy of web search intents for name entity queries.  |
WWW  |
2010 |
DBLP DOI BibTeX RDF |
web search intent, query clustering |
| 1 | Quentin Houben, Jacek Czyz, Juan Carlos Tocino Diaz, Olivier Debeir, Nadine Warzée |
Feature-Based Stereo Vision Using Smart Cameras for Traffic Surveillance.  |
ICVS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi Hu, Wenjie Li, Qin Lu |
Developing Evaluation Model of Topical Term for Document-Level Sentiment Classification.  |
PRICAI  |
2008 |
DBLP DOI BibTeX RDF |
Topical Term, Sentiment Classification, Evaluation Model, Maximum Spanning Tree |
| 1 | Jing Liang, Qilian Liang |
Channel selection algorithms in virtual MIMO sensor networks.  |
HeterSanet  |
2008 |
DBLP DOI BibTeX RDF |
virtual MIMO, channel selection |
| 1 | Takeo Yamada, Kohtaro Watanabe, Seiji Kataoka |
Algorithms to solve the knapsack constrained maximum spanning tree problem.  |
Int. J. Comput. Math.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Xia Chen, Minqiang Li, Wei Zhao, Ding-Yi Chen |
Discovering Conceptual Page Hierarchy of a Web Site from User Traversal History.  |
ADMA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeonghun Cho, Yunheung Paek, David B. Whalley |
Fast memory bank assignment for fixed-point digital signal processors.  |
ACM Trans. Design Autom. Electr. Syst.  |
2004 |
DBLP DOI BibTeX RDF |
dual memory banks, nonorthogonal architecture, Compiler, DSP, dependence analysis, maximum spanning tree |
| 1 | David Eppstein |
Dynamic generators of topologically embedded graphs.  |
SODA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | A. I. Serdjukov |
On finding a maximum spanning tree of bounded radius.  |
Discrete Applied Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Otfried Cheong, Chan-Su Shin, Antoine Vigneron |
Computing Farthest Neighbors on a Convex Polytope.  |
COCOON  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | David R. Karger |
Minimum cuts in near-linear time.  |
J. ACM  |
2000 |
DBLP DOI BibTeX RDF |
tree packing, optimization, connectivity, min-cut, Monte Carlo algorithm |
| 1 | Winfried Nöth, Reiner Kolla |
Spanning Tree-based State Encoding for Low Power Dissipation.  |
DATE  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | David Fernández-Baca |
Faster Non-linear Parametric Search with Applications to Optimazation and Dynamic Geometry.  |
LATIN  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Giulia Galbiati, Angelo Morzenti, Francesco Maffioli |
On the Approximability of Some Maximum Spanning Tree Problems.  |
Theor. Comput. Sci.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Giulia Galbiati, Angelo Morzenti, Francesco Maffioli |
On the Approximability of some Maximum Spanning Tree Problems.  |
LATIN  |
1995 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #23 of 23 (100 per page; Change: )
|
|