A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing (Englisch)
- Neue Suche nach: Guo, J.
- Neue Suche nach: Komusiewicz, C.
- Neue Suche nach: Niedermeier, R.
- Neue Suche nach: Uhlmann, J.
- Neue Suche nach: Guo, J.
- Neue Suche nach: Komusiewicz, C.
- Neue Suche nach: Niedermeier, R.
- Neue Suche nach: Uhlmann, J.
- Neue Suche nach: Goldberg, Andrew V.
- Neue Suche nach: Zhou, Yunhong
In:
Algorithmic aspects in information and management
5564
;
226-239
;
2009
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Print
-
Titel:A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
-
Beteiligte:Guo, J. ( Autor:in ) / Komusiewicz, C. ( Autor:in ) / Niedermeier, R. ( Autor:in ) / Uhlmann, J. ( Autor:in ) / Goldberg, Andrew V. / Zhou, Yunhong
-
Kongress:International conference; 5th, Algorithmic aspects in information and management ; 2009 ; San Francisco, CA
-
Erschienen in:Algorithmic aspects in information and management , 5564 ; 226-239LECTURE NOTES IN COMPUTER SCIENCE , 5564 ; 226-239
-
Verlag:
- Neue Suche nach: Springer
-
Erscheinungsort:Berlin
-
Erscheinungsdatum:01.01.2009
-
Format / Umfang:14 pages
-
Anmerkungen:International conference proceedings.Includes bibliographical references and index
-
ISBN:
-
ISSN:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Print
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Algorithmic Challenge in Online Advertising (Abstract)Broder, A.Z. et al. | 2009
- 2
-
Parallel Algorithms for Collaborative Filtering (Abstract)Chang, E.Y. et al. | 2009
- 3
-
On the Approximability of Some Haplotyping ProblemsAbraham, J. / Chen, Z. / Fowler, R. / Fu, B. / Zhu, B. et al. | 2009
- 15
-
On Acyclicity of Games with CyclesAndersson, D. / Gurvich, V. / Hansen, T.D. et al. | 2009
- 29
-
Discrete Online TSPAprea, M. / Feuerstein, E. / Sadovoy, G. / de Loma, A.S. et al. | 2009
- 43
-
On Approximating an Implicit Cover Problem in BiologyAshley, M.V. / Berger-Wolf, T.Y. / Chaovalitwongse, W. / DasGupta, B. / Khokhar, A. / Sheikh, S. et al. | 2009
- 55
-
Power Indices in Spanning Connectivity GamesAziz, H. / Lachish, O. / Paterson, M. / Savani, R. et al. | 2009
- 68
-
Efficiently Generating k-Best Solutions to Procurement AuctionsByde, A. / Kelly, T. / Zhou, Y. / Tarjan, R. et al. | 2009
- 85
-
Integer Polyhedra for Program AnalysisCharles, P.J. / Howe, J.M. / King, A. et al. | 2009
- 100
-
Line Segment Facility Location in Weighted SubdivisionsCheung, Y.K. / Daescu, O. et al. | 2009
- 114
-
Algorithms for Placing Monitors in a Flow NetworkChin, F. / Chrobak, M. / Yan, L. et al. | 2009
- 129
-
Three Results on Frequency Assignment in Linear Cellular Networks (Extended Abstract)Chrobak, M. / Sgall, J. et al. | 2009
- 140
-
Link Distance and Shortest Path Problems in the PlaneCook, A.F. / Wenk, C. et al. | 2009
- 152
-
Orca Reduction and ContrAction Graph ClusteringDelling, D. / Gorke, R. / Schulz, C. / Wagner, D. et al. | 2009
- 166
-
Equiseparability on Terminal Wiener IndexDeng, X. / Zhang, J. et al. | 2009
- 175
-
Effective Tour Searching for TSP by Contraction of Pseudo Backbone EdgesDong, C. / Jager, G. / Richter, D. / Molitor, P. et al. | 2009
- 188
-
Optimal Auctions Capturing Constraints in Sponsored SearchFeuerstein, E. / Heiber, P.A. / Lopez-Rosenfeld, M. / Mydlarz, M. et al. | 2009
- 202
-
A Note on Estimating Hybrid Frequency Moment of Data StreamsGanguly, S. et al. | 2009
- 212
-
Two-Level Push-Relabel Algorithm for the Maximum Flow ProblemGoldberg, A.V. et al. | 2009
- 226
-
A More Relaxed Model for Graph-Based Data Clustering: s-Plex EditingGuo, J. / Komusiewicz, C. / Niedermeier, R. / Uhlmann, J. et al. | 2009
- 240
-
Dynamic Position Auctions with Consumer SearchKominers, S.D. et al. | 2009
- 251
-
Nonlinear Optimization over a Weighted Independence SystemLee, J. / Onn, S. / Weismantel, R. et al. | 2009
- 265
-
Improved Online Algorithms for Multiplexing Weighted Packets in Bounded BuffersLi, F. et al. | 2009
- 279
-
Latency Constrained Aggregation in Chain Networks Admits a PTASNonner, T. / Souza, A. et al. | 2009
- 292
-
Cutting a Cake for Five PeopleSaberi, A. / Wang, Y. et al. | 2009
- 301
-
PLDA: Parallel Latent Dirichlet Allocation for Large-Scale ApplicationsWang, Y. / Bai, H. / Stanton, M. / Chen, W.-Y. / Chang, E.Y. et al. | 2009
- 315
-
On Job Scheduling with Preemption PenaltiesZheng, F. / Xu, Y. / Poon, C.K. et al. | 2009