| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA990000547760203316 |
|
|
Autore |
COLLIER, John |
|
|
Titolo |
Visual anthropology : photography as a research method / John Collier, jr. and Malcolm Collier ; foreword by Edward T. Hall |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Albuquerque : University of New Mexico, 1987 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Descrizione fisica |
|
XVII, 248 p. : ill. ; 25 cm |
|
|
|
|
|
|
Altri autori (Persone) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Fotografia - Impegno in etnologia |
|
|
|
|
|
|
Collocazione |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910767529603321 |
|
|
Titolo |
Algorithm Theory - SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings / / edited by Torben Hagerup, Jyrki Katajainen |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2004.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 512 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 3111 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Numerical analysis |
Mathematical models |
Algorithms |
Computer networks |
Data structures (Computer science) |
Computer science—Mathematics |
Numerical Analysis |
Mathematical Modeling and Industrial Mathematics |
Algorithm Analysis and Problem Complexity |
Computer Communication Networks |
Data Structures |
Discrete Mathematics in Computer Science |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references at the end of each chapters and index. |
|
|
|
|
|
|
|
|
Nota di contenuto |
|
Invited Contributions -- Design and Analysis of Dynamic Multithreaded Algorithms -- Cache-Oblivious Algorithms and Data Structures -- Refereed Contributions -- Getting the Best Response for Your Erg -- Auctions with Budget Constraints -- Tight Approximability Results for Test Set Problems in Bioinformatics -- Robust Subgraphs for Trees and Paths -- Collective Tree Spanners of Graphs -- Optimally Competitive List Batching -- The Relative Worst Order Ratio Applied to Seat Reservation -- Online Maintenance of k-Medians and k-Covers on a Line -- Matching Polyhedral Terrains Using Overlays of Envelopes -- |
|
|
|
|
|
|
|
|
|
|
|
Independent Set of Intersection Graphs of Convex Objects in 2D -- Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion -- Construction of the Nearest Neighbor Embracing Graph of a Point Set -- Connectivity of Graphs Under Edge Flips -- Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity -- A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension -- Railway Delay Management: Exploring Its Algorithmic Complexity -- Layered Heaps -- Melding Priority Queues -- An Algorithm for Cyclic Edge Connectivity of Cubic Graphs -- Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices -- New Algorithms for Enumerating All Maximal Cliques -- The Multi-multiway Cut Problem -- The Bottleneck Problem with Minimum Quantity Commitments -- All-Norm Approximation for Scheduling on Identical Machines -- Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler -- Approximation Schemes for the Crane Scheduling Problem -- Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems -- A ( )–Approximation Algorithm for the Stable Marriage Problem -- Maximizing the Number of Packed Rectangles -- Two Space Saving Tricks for Linear Time LCP Array Computation -- Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles -- Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks -- Online Scheduling of Splittable Tasks in Peer-to-Peer Networks -- The Optimal Online Algorithms for Minimizing Maximum Lateness -- Power Assignment in Radio Networks with Two Power Levels -- Pointed Binary Encompassing Trees -- On Geometric Structure of Global Roundings for Graphs and Range Spaces -- External Connected Components -- Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths -- Simplified External Memory Algorithms for Planar DAGs. |
|
|
|
|
|
|
Sommario/riassunto |
|
This volume contains the papers presented at SWAT 2004, the 9th Scandi- vian Workshop on Algorithm Theory, which was held on July 8–10, 2004, at the Louisiana Museum of Modern Art in Humlebæk on the Øresund coast north of Copenhagen. The SWAT workshop, in reality a full-?edged conference, has been held biennially since 1988 and rotates among the ?ve Nordic countries, D- mark, Finland, Iceland, Norway, and Sweden. The previous meetings took place ? in Halmstad (1988), Bergen (1990), Helsinki (1992), Arhus (1994), Reykjavik (1996), Stockholm (1998), Bergen (2000), and Turku (2002). SWAT alternates with the Workshop on Algorithms and Data Structures (WADS), held in o- numbered years. Thecallforpapersinvitedcontributionsonallaspectsofalgorithmtheory.A totalof121submissionswasreceived—anoverallSWAThigh.Theseunderwent thorough reviewing, and the program committee met in Copenhagen on March 20–21, 2004, and selected 40 papers for presentation at the conference. The programcommitteewasimpressedwiththequalityofthesubmissionsand,given the constraints imposed by the choice of conference venue and duration, had to make some tough decisions. The scienti?c program was enriched by invited presentations by Gerth Stølting Brodal (University of Aarhus) and Charles E. Leiserson (Massachusetts Institute of Technology). TwosatelliteeventswereheldimmediatelybeforeSWAT2004:theWorkshop on On-Line Algorithms (OLA 2004), organized by members of the Department of Mathematics and Computer Science at the University of Southern Denmark, and the Summer School on Experimental Algorithmics, organized by the Perf- mance Engineering Laboratory in |
|
|
|
|
|
|
|
|
|
|
|
|
|
the Department of Computing at the Univ- sity of Copenhagen. More information about SWAT 2004 and its satellite events is available at the conference web sitehttp://swat.diku.dk/. |
|
|
|
|
|
|
3. |
Record Nr. |
UNINA9910299458003321 |
|
|
Titolo |
3D Geoinformation Science : The Selected Papers of the 3D GeoInfo 2014 / / edited by Martin Breunig, Mulhim Al-Doori, Edgar Butwilowski, Paul V. Kuper, Joachim Benner, Karl Heinz Haefele |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2015.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (254 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Geoinformation and Cartography, , 1863-2246 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Geographic information systems |
Application software |
Geographical Information Systems/Cartography |
Information Systems Applications (incl. Internet) |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references at the end of each chapters. |
|
|
|
|
|
|
Nota di contenuto |
|
Improving the Consistency of Multi-LOD Citygml Datasets by Removing Redundancy -- Generalization of 3D IFC Building Models -- Modeling and Managing Topology for 3-D Track Planning Applications -- Multi-Resolution Models: Recent Progress in Coupling 3D Geometry to Environmental Numerical Simulation -- Crisp Clustering Algorithm for 3D Geospatial Vector Data Quantization -- A Hybrid Approach Integrating 3d City Models, Remotely Sensed Sar Data And Interval-Valued Fuzzy Soft Set Based Decision Making for Post Disaster Mapping of Urban Areas -- Change Detection in Citygml Documents -- Change Detection of Cities -- Advances in Structural Monitoring by an Integrated Analysis of Sensor Measurements and 3d Building Model -- Requirements on Building Models Enabling The Guidance In A Navigation Scenario Using Cognitive Concepts -- Context Aware Indoor Route Planning using Semantic 3d Building Models with Cloud |
|
|
|
|
|
|
|
|
|
|
|
Computing -- Exploring the Benefits of 3D city Models in the Field of Urban Particles Distribution Modelling – a Comparison of Model Results -- 3d Modelling with National Coverage: Bridging the Gap between Research and Practice -- Out-of-core Visualization of Classified 3D Point Clouds -- Modeling Visibility in 3d Space: A Qualitative Frame of Reference. |
|
|
|
|
|
|
Sommario/riassunto |
|
Nowadays 3D Geoinformation is needed for many planning and analysis tasks. For example, 3D city and infrastructure models are paving the way for complex environmental and noise analyzes. 3D geological sub-surface models are needed for reservoir exploration in the oil-, gas-, and geothermal industry. Thus 3D Geoinformation brings together researchers and practitioners from different fields such as the geo-sciences, civil engineering, 3D city modeling, 3D geological and geophysical modeling, and, last but not least, computer science. The diverse challenges of 3D Geoinformation Science concern new approaches and the development of standards for above- and under-ground 3D modeling, efficient 3D data management, visualization and analysis. Finally, the integration of different 3D approaches and data models is seen as one of the most important challenges to be solved. |
|
|
|
|
|
|
|
| |