FEEDBACK Smiley face

Frontiers in Algorithmics (Record no. 18598)

000 -LEADER
fixed length control field 05183nam a22005895i 4500
001 - CONTROL NUMBER
control field 978-3-642-02270-8
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20170515111705.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 100301s2009 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642022708
-- 978-3-642-02270-8
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-642-02270-8
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.D35
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMB
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM062000
Source bisacsh
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.73
Edition number 23
245 10 - TITLE STATEMENT
Title Frontiers in Algorithmics
Medium [electronic resource] :
Remainder of title Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings /
Statement of responsibility, etc edited by Xiaotie Deng, John E. Hopcroft, Jinyun Xue.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg :
-- Imprint: Springer,
-- 2009.
300 ## - PHYSICAL DESCRIPTION
Extent XIV, 372 p.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
International Standard Serial Number 0302-9743 ;
Volume number/sequential designation 5598
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note FAW 2009 -- Study on Parallel Computing -- Communication Complexity and Its Applications -- Algorithmic Problems in Computer and Network Power Management -- Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains -- Edge Search Number of Cographs in Linear Time -- Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems -- Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs -- Covering-Based Routing Algorithms for Cyclic Content-Based P/S System -- On the ?-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games -- Cop-Robber Guarding Game with Cycle Robber Region -- Covered Interest Arbitrage in Exchange Rate Forecasting Markets -- CFI Construction and Balanced Graphs -- Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions -- Space–Query-Time Tradeoff for Computing the Visibility Polygon -- Square and Rectangle Covering with Outliers -- Processing an Offline Insertion-Query Sequence with Applications -- Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs -- On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs -- On Modulo Linked Graphs -- Pathwidth is NP-Hard for Weighted Trees -- A Max-Margin Learning Algorithm with Additional Features -- DDoS Attack Detection Algorithm Using IP Address Features -- Learning with Sequential Minimal Transductive Support Vector Machine -- Junction Tree Factored Particle Inference Algorithm for Multi-Agent Dynamic Influence Diagrams -- An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set -- Heuristics for Mobile Object Tracking Problem in Wireless Sensor Networks -- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems -- The BDD-Based Dynamic A* Algorithm for Real-Time Replanning -- Approximating Scheduling Machines with Capacity Constraints -- Approximating the Spanning k-Tree Forest Problem -- Toward an Automatic Approach to Greedy Algorithms -- A Novel Approximate Algorithm for Admission Control -- On the Structure of Consistent Partitions of Substring Set of a Word -- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet -- An Improved Database Classification Algorithm for Multi-database Mining -- Six-Card Secure AND and Four-Card Secure XOR.
520 ## - SUMMARY, ETC.
Summary, etc This book constitutes the refereed proceedings of the Third International Frontiers of Algorithmics Workshop, FAW 2009, held in Hefei, Anhui, China, in June 2009. The 33 revised full papers presented together with the abstracts of 3 invited talks were carefully reviewed and selected from 87 submissions. The papers are organized in topical sections on graph algorithms; game theory with applications; graph theory, computational geometry; machine learning; parameterized algorithms, heuristics and analysis; approximation algorithms; as well as pattern recognition algorithms, large scale data mining.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Software engineering.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data structures (Computer science).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science
General subdivision Mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial intelligence.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data Structures.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematics of Computing.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial Intelligence (incl. Robotics).
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Software Engineering/Programming and Operating Systems.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Deng, Xiaotie.
Relator term editor.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Hopcroft, John E.
Relator term editor.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Xue, Jinyun.
Relator term editor.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783642022692
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
-- 0302-9743 ;
Volume number/sequential designation 5598
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-02270-8
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Koha item type e-Book

No items available.


© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in