• Suche: "F.2.2: Nonnumerical Algorithms and Problems"

Treffer 41 - 60 von 362

41

Sponsored Search, Market Equilibria, and the Hungarian Method
Dütting, Paul ; Henzinger, Monika ; Weber, Ingmar ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :287-298

Nancy, France stablematching envy-free allocation general auction mechanis... general position ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
42

Dynamic sharing of a multiple access channel
Bienkowski, Marcin ; Klonowski, Marek ; Korzeniowski, Miroslaw ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :83-94

Nancy, France distributed algorithms multiple access channel mutual exclusion ACM: C.: Computer System... C.1: PROCESSOR ARCHITECT... …
Konferenz
Zu den Favoriten
43

An Efficient Quantum Algorithm for some Instances of the Group Isomorphism Problem
Le Gall, François ; Department of Computer Science ; University of Tokyo [Tokyo] = Tōkyō teikoku daigaku (UTokyo) ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :549-560

Nancy, France Quantum Algorithms Group Isomorphism Proble... Black-box Groups ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Konferenz
Zu den Favoriten
44

Online Correlation Clustering
Mathieu, Claire ; Sankur, Ocan ; Schudy, Warren ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :573-584

Nancy, France correlation clustering online algorithms ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... …
Konferenz
Zu den Favoriten
45

The tropical double description method
Allamigeon, Xavier ; Gaubert, Stéphane ; Goubault, Eric ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :47-58

Nancy, France convexity in tropical al... algorithmics and combina... computational geometry discrete event systems static analysis …
Konferenz
Zu den Favoriten
46

Minimum delay Data Gathering in Radio Networks
Bermond, Jean-Claude ; Nisse, Nicolas ; Reyes, Patricio ; et al.
ADHOC-NOW 2009 - 8th international conference on Ad Hoc Networks and Wireless. :69-82

Murcia, Spain ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... C.2.2: Network Protocols C.2.2.3: Routing protoco... ACM: G.: Mathematics of... …
Konferenz
Zu den Favoriten
47

Appearance-guided Synthesis of Element Arrangements by Example
Hurtut, Thomas ; Landes, Pierre-Edouard ; Thollot, Joëlle ; et al.
NPAR 2009 - 7th International Symposium on Non-Photorealistic Animation and Rendering. :51-60

New Orleans, LA, United... NPR by-example synthesis Vector texture synthesis ACM: I.: Computing Metho... I.3: COMPUTER GRAPHICS …
Konferenz
Zu den Favoriten
48

Approximating Acyclicity Parameters of Sparse Hypergraphs
Fomin, Fedor V. ; Golovach, Petr A. ; Thilikos, Dimitrios M. ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :445-456

Freiburg, Germany Graph hypergraph hypertree width treewidth ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
49

Shortest Paths Avoiding Forbidden Subpaths
Ahmed, Mustaq ; Lubiw, Anna ; David R. Cheriton School of Computer Science ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :63-74

Freiburg, Germany Algorithms and data stru... Graph algorithms Optical networks ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... …
Konferenz
Zu den Favoriten
50

Lower Bounds for Multi-Pass Processing of Multiple Data Streams
Schweikardt, Nicole ; Institut für Informatik ; Goethe University Frankfurt = Goethe-Universität Frankfurt am Main ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :51-62

Freiburg, Germany data streams lower bounds machine models automata the set disjointness pro... …
Konferenz
Zu den Favoriten
51

Generating Shorter Bases for Hard Random Lattices
Alwen, Joël ; Peikert, Chris ; New York University ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :75-86

Freiburg, Germany lattices random short basis average-case hardness Hermite normal form …
Konferenz
Zu den Favoriten
52

Economical Caching
Englert, Matthias ; Röglin, Heiko ; Spönemann, Jacob ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :385-396

Freiburg, Germany Online Algorithms Competitive Analysis Storage Management ACM: F.: Theory of Compu... F.1: COMPUTATION BY ABST... …
Konferenz
Zu den Favoriten
53

A Generalization of Nemhauser and Trotter's Local Optimization Theorem
Fellows, Michael R. ; Guo, Jiong ; Moser, Hannes ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :409-420

Freiburg, Germany graph problems kernelization combinatorial optimizati... fixed-parameter tractabi... W[2]-completeness …
Konferenz
Zu den Favoriten
54

Efficient Isomorphism Testing for a Class of Group Extensions
Le Gall, François ; ERATO-SORST Quantum Computation and Information Project ; Japan Science and Technology Agency ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :625-636

Freiburg, Germany polynomial-time algorith... group isomorphism black-box groups ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Konferenz
Zu den Favoriten
55

Polynomial Kernelizations for MIN F+PI 1 and MAX NP
Kratsch, Stefan ; Max-Planck-Institut für Informatik (MPII) ; Max-Planck-Gesellschaft ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :601-612

Freiburg, Germany parameterized complexity kernelization approximation algorithms ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Konferenz
Zu den Favoriten
56

Generalized Attachment Models for the Genesis of Graphs with High Clustering Coefficient
Gustedt, Jens ; Algorithms for the Grid (ALGORILLE) ; INRIA Lorraine ; et al.
Santo Fortunato and Giuseppe Mangioni and Ronaldo Menezes and Vincenzo Nicosia. Complex Networks - Results of the 2009 International Workshop on Complex Networks (CompleNet 2009). :99-113

attachment models random graph generation k-trees ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... …
Buch
Zu den Favoriten
57

The Voronoi Diagram of Three Lines
Everett, Hazel ; Lazard, Daniel ; Lazard, Sylvain ; et al.
23rd Annual Symposium on Computational Geometry (SoCG'07). :255-264

Gyeongju, South Korea quadric surface intersec... medial axis Voronoi diagram ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Konferenz
Zu den Favoriten
58

Line transversals to disjoint balls
Borcea, Ciprian ; Goaoc, Xavier ; Petitjean, Sylvain ; et al.
23rd Annual ACM Symposium on Computational Geometry 2007 - SoCG'07. :245-254

Gyeongju, South Korea lines geometric transversal th... disjoint balls convexity Hessian …
Konferenz
Zu den Favoriten
59

An experimental validation of the PRO model for parallel and distributed computation
Essaïdi, Mohamed ; Gustedt, Jens ; Simulation, modeling and analysis of heterogeneous systems (SMASH) ; et al.
14th Euromicro International Conference on Parallel. :449-456

Montbeliard-Sochaux, Fra... ACM: D.: Software D.1: PROGRAMMING TECHNIQ... D.1.3: Concurrent Progra... D.1.3.0: Distributed pro... D.2: SOFTWARE ENGINEERIN... …
Konferenz
Zu den Favoriten
60

Hierarchical Scheduling for Moldable Tasks
Dutot, Pierre-François ; Parallel algorithms and load sharing (APACHE) ; Informatique et Distribution (ID-IMAG) ; et al.
Euro-Par. :302-311

Scheduling Hierarchical Algorithm ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... …
Konferenz
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter