Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
SOFSEM 2006: Theory and Practice of Computer Science [[electronic resource] ] : 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, January 21-27, 2006, Proceedings / / edited by Jirí Wiedermann, Gerard Tel, Jaroslav Pokorný, Mária Bieliková, Július Štuller
| SOFSEM 2006: Theory and Practice of Computer Science [[electronic resource] ] : 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, January 21-27, 2006, Proceedings / / edited by Jirí Wiedermann, Gerard Tel, Jaroslav Pokorný, Mária Bieliková, Július Štuller |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XVI, 580 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer networks Software engineering Database management Information storage and retrieval systems Application software Theory of Computation Computer Communication Networks Software Engineering Database Management Information Storage and Retrieval Computer and Information Systems Applications |
| ISBN | 3-540-32217-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- How Can Nature Help Us Compute? -- Evolving Ontology Evolution -- A Formal Comparison of Visual Web Wrapper Generators -- Beyond the Horizon: Planning Future European ICT R&D -- Selfish Routing in Networks -- New Physics and Hypercomputation -- Models and Algorithms for Wireless Sensor Networks (Smart Dust) -- SomeWhere in the Semantic Web -- Mobility in Wireless Networks -- Group Communication: From Practice to Theory -- Regular Papers -- A General Data Reduction Scheme for Domination in Graphs -- Incremental Method for XML View Maintenance in Case of Non Monitored Data Sources -- Non-intersecting Complexity -- Constructing Interference-Minimal Networks -- Matching Points with Rectangles and Squares -- Searching Paths of Constant Bandwidth -- Graph Searching and Search Time -- Reasoning About Inconsistent Concurrent Systems: A Non-classical Temporal Logic -- Simple Algorithm for Sorting the Fibonacci String Rotations -- Oriented Coloring: Complexity and Approximation -- nonblocker: Parameterized Algorithmics for minimum dominating set -- Quantum Finite Automata and Logics -- FDSI-Tree: A Fully Distributed Spatial Index Tree for Efficient & Power-Aware Range Queries in Sensor Networks -- Roman Domination: A Parameterized Perspective -- Sedna: A Native XML DBMS -- Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring -- The Knowledge Cartography – A New Approach to Reasoning over Description Logics Ontologies -- Complexity and Exact Algorithms for Multicut -- Using Extensible Heterogeneous Database Transformers -- P-Selectivity, Immunity, and the Power of One Bit -- Transparent Migration of Database Services -- Merging and Merge-Sort in a Single Hop Radio Network -- On Optimal and Efficient in Place Merging -- A Personalized Recommendation System Based on PRML for E-Commerce -- An Efficient Index Scheme for XML Databases -- On Separating Constant from Polynomial Ambiguity of Finite Automata -- Reliable Broadcasting Without Collision Detection -- Semi-strong Static Type Checking of Object-Oriented Query Languages -- Building a Fuzzy Transformation System -- News Generating Via Fuzzy Summarization of Databases -- Improving Web Sites with Web Usage Mining, Web Content Mining, and Semantic Analysis -- Automatic Distribution of Sequential Code Using JavaSymphony Middleware -- Unifying Framework for Message Passing -- Heuristics on the Definition of UML Refinement Patterns -- The Complexity of Problems on Implicitly Represented Inputs -- How Many Dots Are Really Needed for Head-Driven Chart Parsing? -- Ontology Acquisition for Automatic Building of Scientific Portals -- Improved ROCK for Text Clustering Using Asymmetric Proximity -- Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet -- Computational Complexity of Relay Placement in Sensor Networks -- On the NP-Completeness of Some Graph Cluster Measures -- A Flexible Policy Architecture for Mobile Agents -- An Improved Digital Signature with Message Recovery Using Self-certified Public Keys Without Trustworthy System Authority -- Small Independent Edge Dominating Sets in Graphs of Maximum Degree Three -- The Best Student Paper -- Level-of-Detail in Behaviour of Virtual Humans. |
| Record Nr. | UNISA-996465594103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
SOFSEM 2014: Theory and Practice of Computer Science [[electronic resource] ] : 40th International Conference on Current Trends in Theory and Practice of Computer Science,Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings / / edited by Viliam Geffert, Bart Preneel, Branislav Rovan, Július Štuller, A Min Tjoa
| SOFSEM 2014: Theory and Practice of Computer Science [[electronic resource] ] : 40th International Conference on Current Trends in Theory and Practice of Computer Science,Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings / / edited by Viliam Geffert, Bart Preneel, Branislav Rovan, Július Štuller, A Min Tjoa |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXIV, 528 p. 103 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Information storage and retrieval systems Software engineering Artificial intelligence Artificial intelligence—Data processing Discrete Mathematics in Computer Science Information Storage and Retrieval Software Engineering Artificial Intelligence Data Science |
| Soggetto genere / forma | Conference papers and proceedings. |
| ISBN | 3-319-04298-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Open Services for Software Process Compliance Engineering -- Episode-Centric Conceptual Modeling -- Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems -- Advice Complexity: Quantitative Approach to A-Priori Information -- Matching of Images of Non-Planar Objects with View Synthesis -- Agile Requirements Engineering: A Research Perspective -- Contributed Papers -- Fitting Planar Graphs on Planar Maps -- Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth -- Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem -- On the Power of Advice and Randomization for the Disjoint Path Allocation Problem -- Goal-Based Establishment of an Information Security Management System Compliant to ISO 27001 -- ProofBook: An Online Social Network Based on Proof-of-Work and Friend-Propagation -- Platform Independent Software Development Monitoring: Design of an Architecture -- Towards Unlocking the Full Potential of Multileaf Collimators -- Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs -- Error-Pruning in Interface Automata -- Aspect-Driven Design of Information Systems -- Exact Algorithms to Clique-Colour Graphs -- Supporting Non-Functional Requirements in Services Software Development Process: an MDD Approach -- Safety Contracts for Timed Reactive Components in SysML -- Graph Clustering with Surprise: Complexity and Exact Solutions -- On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms -- Active Learning of Recursive Functions by Ultrametric Algorithms -- Efficient Error-Correcting Codes for Sliding Windows -- Integrating UML Composite Structures and fUML -- Deciding the Value 1 Problem for #-Acyclic Partially Observable Markov Decision Processes -- Bidimensionality of Geometric Intersection Graphs -- Attack Against a Pairing Based Anonymous Authentication Protocol -- Finding Disjoint Paths in Split Graphs -- A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing -- A Stronger Square Conjecture on Binary Words -- DSL Based Platform for Business Process Management -- Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints -- Deterministic Verification of Integer Matrix Multiplication in Quadratic Time -- Comparison of Genetic Algorithms for Trading Strategies -- Probabilistic Admissible Encoding on Elliptic Curves -Towards PACE with Generalized Integrated Mapping -- An Algebraic Framework for Modeling of Reactive Rule-Based Intelligent Agents -- Parameterized Prefix Distance Between Regular Languages -- Ordered Restarting Automata for Picture Languages -- Unary NFAs with Limited Nondeterminism -- Recommending for Disloyal Customers with Low Consumption Rate -- Security Constraints in Modeling of Access Control Rules for Dynamic Information Systems -- A New Plane-Sweep Algorithm for the K-Closest-Pairs Query -- Mastering Erosion of Software Architecture in Automotive Software Product Lines -- Shortest Unique Substrings Queries in Optimal Time -- Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages. |
| Record Nr. | UNISA-996205184603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
SOFSEM 2014: Theory and Practice of Computer Science : 40th International Conference on Current Trends in Theory and Practice of Computer Science,Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings / / edited by Viliam Geffert, Bart Preneel, Branislav Rovan, Július Štuller, A Min Tjoa
| SOFSEM 2014: Theory and Practice of Computer Science : 40th International Conference on Current Trends in Theory and Practice of Computer Science,Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings / / edited by Viliam Geffert, Bart Preneel, Branislav Rovan, Július Štuller, A Min Tjoa |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXIV, 528 p. 103 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Information storage and retrieval systems Software engineering Artificial intelligence Artificial intelligence—Data processing Discrete Mathematics in Computer Science Information Storage and Retrieval Software Engineering Artificial Intelligence Data Science |
| Soggetto genere / forma | Conference papers and proceedings. |
| ISBN | 3-319-04298-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Open Services for Software Process Compliance Engineering -- Episode-Centric Conceptual Modeling -- Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems -- Advice Complexity: Quantitative Approach to A-Priori Information -- Matching of Images of Non-Planar Objects with View Synthesis -- Agile Requirements Engineering: A Research Perspective -- Contributed Papers -- Fitting Planar Graphs on Planar Maps -- Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth -- Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem -- On the Power of Advice and Randomization for the Disjoint Path Allocation Problem -- Goal-Based Establishment of an Information Security Management System Compliant to ISO 27001 -- ProofBook: An Online Social Network Based on Proof-of-Work and Friend-Propagation -- Platform Independent Software Development Monitoring: Design of an Architecture -- Towards Unlocking the Full Potential of Multileaf Collimators -- Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs -- Error-Pruning in Interface Automata -- Aspect-Driven Design of Information Systems -- Exact Algorithms to Clique-Colour Graphs -- Supporting Non-Functional Requirements in Services Software Development Process: an MDD Approach -- Safety Contracts for Timed Reactive Components in SysML -- Graph Clustering with Surprise: Complexity and Exact Solutions -- On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms -- Active Learning of Recursive Functions by Ultrametric Algorithms -- Efficient Error-Correcting Codes for Sliding Windows -- Integrating UML Composite Structures and fUML -- Deciding the Value 1 Problem for #-Acyclic Partially Observable Markov Decision Processes -- Bidimensionality of Geometric Intersection Graphs -- Attack Against a Pairing Based Anonymous Authentication Protocol -- Finding Disjoint Paths in Split Graphs -- A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing -- A Stronger Square Conjecture on Binary Words -- DSL Based Platform for Business Process Management -- Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints -- Deterministic Verification of Integer Matrix Multiplication in Quadratic Time -- Comparison of Genetic Algorithms for Trading Strategies -- Probabilistic Admissible Encoding on Elliptic Curves -Towards PACE with Generalized Integrated Mapping -- An Algebraic Framework for Modeling of Reactive Rule-Based Intelligent Agents -- Parameterized Prefix Distance Between Regular Languages -- Ordered Restarting Automata for Picture Languages -- Unary NFAs with Limited Nondeterminism -- Recommending for Disloyal Customers with Low Consumption Rate -- Security Constraints in Modeling of Access Control Rules for Dynamic Information Systems -- A New Plane-Sweep Algorithm for the K-Closest-Pairs Query -- Mastering Erosion of Software Architecture in Automotive Software Product Lines -- Shortest Unique Substrings Queries in Optimal Time -- Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages. |
| Record Nr. | UNINA-9910484965403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||