Muutke küpsiste eelistusi

E-raamat: Algorithmic Aspects in Information and Management: 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009, Proceedings

Edited by , Edited by
  • Formaat: PDF+DRM
  • Sari: Lecture Notes in Computer Science 5564
  • Ilmumisaeg: 18-Jun-2009
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Keel: eng
  • ISBN-13: 9783642021589
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 55,56 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: PDF+DRM
  • Sari: Lecture Notes in Computer Science 5564
  • Ilmumisaeg: 18-Jun-2009
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Keel: eng
  • ISBN-13: 9783642021589
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book constitutes the proceedings of the 5th International Conference on Algorithmic Aspects in Information Management, AAIM 2009, held in San Francisco, CA, USA, in June 2009.
The 25 papers presented together with the abstracts of two invited talks were carefully reviewed and selected for inclusion in this book.
While the areas of information management and management science are full of algorithmic challenges, the proliferation of data (Internet, biology, finance etc) has called for the design of efficient and scalable algorithms and data structures for their management and processing. This conference is intended for original algorithmic research on immediate applications and/or fundamental problems pertinent to information management and management science, broadly construed. The conference aims at bringing together researchers in Computer Science, Operations Research, Economics, Game Theory, and related disciplines.

This book constitutes the proceedings of the 5th International Conference on Algorithmic Aspects in Information Management, AAIM 2009, held in San Francisco, CA, USA, in June 2009. The 25 papers presented together with the abstracts of two invited talks were carefully reviewed and selected for inclusion in this book. While the areas of information management and management science are full of algorithmic challenges, the proliferation of data (Internet, biology, finance etc) has called for the design of efficient and scalable algorithms and data structures for their management and processing. This conference is intended for original algorithmic research on immediate applications and/or fundamental problems pertinent to information management and management science, broadly construed. The conference aims at bringing together researchers in Computer Science, Operations Research, Economics, Game Theory, and related disciplines.
Algorithmic Challenge in Online Advertising (Abstract)
1(1)
Andrei Z. Broder
Parallel Algorithms for Collaborative Filtering (Abstract)
2(1)
Edward Y. Chang
On the Approximability of Some Haplotyping Problems
3(12)
John Abraham
Zhixiang Chen
Richard Fowler
Bin Fu
Binhai Zhu
On Acyclicity of Games with Cycles
15(14)
Darnel Andersson
Vladimir Gurvich
Thomas Dueholm Hansen
Discrete Online TSP
29(14)
Mauro Aprea
Esteban Feuerstein
Gustavo Sadovoy
Alejandro Strejilevich de Loma
On Approximating an Implicit Cover Problem in Biology
43(12)
Mary V. Ashley
Tanya Y. Berger-Wolf
Wanpracha Chaovalitwongse
Bhaskar DasGupta
Ashfaq Khokhar
Saad Sheikh
Power Indices in Spanning Connectivity Games
55(13)
Haris Aziz
Oded Lachish
Mike Paterson
Rahul Savani
Efficiently Generating k-Best Solutions to Procurement Auctions
68(17)
Andrew Byde
Terence Kelly
Yunhong Zhou
Robert Tarjan
Integer Polyhedra for Program Analysis
85(15)
Philip J. Charles
Jacob M. Howe
Andy King
Line Segment Facility Location in Weighted Subdivisions
100(14)
Yam Ki Cheung
Ovidiu Daescu
Algorithms for Placing Monitors in a Flow Network
114(15)
Francis Chin
Marek Chrobak
Li Yan
Three Results on Frequency Assignment in Linear Cellular Networks (Extended Abstract)
129(11)
Marek Chrobak
Jiri Sgall
Link Distance and Shortest Path Problems in the Plane
140(12)
Atlas F. Cook IV
Carola Wenk
Orca Reduction and Contr Action Graph Clustering
152(14)
Daniel Delling
Robert Gorke
Christian Schulz
Dorothea Wagner
Equiseparability on Terminal Wiener Index
166(9)
Xiaotie Deng
Jie Zhang
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges
175(13)
Changxing Dong
Geroid Jager
Dirk Richter
Paul Molitor
Optimal Auctions Capturing Constraints in Sponsored Search
188(14)
Esteban Feuerstein
Pablo Ariel Heiber
Matias Lopez-Rosenfeld
Marcelo Mydlarz
A Note on Estimating Hybrid Frequency Moment of Data Streams
202(10)
Sumit Ganguly
Two-Level Push-Relabel Algorithm for the Maximum Flow Problem
212(14)
Andrew V. Goldberg
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
226(14)
Jiong Guo
Christian Komusiewicz
Rolf Niedermeier
Johannes Uhlmann
Dynamic Position Auctions with Consumer Search
240(11)
Scott Duke Kominers
Nonlinear Optimization over a Weighted Independence System
251(14)
Jon Lee
Shmuel Onn
Robert Weismantel
Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
265(14)
Fei Li
Latency Constrained Aggregation in Chain Networks Admits a PTAS
279(13)
Tim Nonner
Alexander Souza
Cutting a Cake for Five People
292(9)
Amin Saberi
Ying Wang
PLDA: Parallel Latent Dirichlet Allocation for Large-Scale Applications
301(14)
Yi Wang
Hongjie Bai
Matt Stanton
Wen-Yen Chen
Edward Y. Chang
On Job Scheduling with Preemption Penalties
315(12)
Feifeng Zheng
Yinfeng Xu
Chung Keung Poon
Author Index 327