Sciweavers

11212 search results - page 612 / 2243
» Semi-persistent Data Structures
Sort
View
CIKM
2011
Springer
14 years 7 months ago
Keyword search over RDF graphs
Large knowledge bases consisting of entities and relationships between them have become vital sources of information for many applications. Most of these knowledge bases adopt the...
Shady Elbassuoni, Roi Blanco
ESA
2011
Springer
249views Algorithms» more  ESA 2011»
14 years 6 months ago
Improved Algorithms for Partial Curve Matching
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
Anil Maheshwari, Jörg-Rüdiger Sack, Kave...
EUROPAR
2011
Springer
14 years 6 months ago
A Generic Parallel Collection Framework
Most applications manipulate structured data. Modern languages and platforms provide collection frameworks with basic data structures like lists, hashtables and trees. These data ...
Aleksandar Prokopec, Phil Bagwell, Tiark Rompf, Ma...
GECCO
2003
Springer
123views Optimization» more  GECCO 2003»
16 years 10 days ago
Benefits of Implicit Redundant Genetic Algorithms for Structural Damage Detection in Noisy Environments
A robust structural damage detection method that can handle noisy frequency response function information is discussed. The inherent unstructured nature of damage detection problem...
Anne M. Raich, Tamás Liszkai
ICC
2007
IEEE
110views Communications» more  ICC 2007»
16 years 1 months ago
A New STC Structure to Achieve Generalized Optimal Diversity with a Reduced Design Complexity
Abstract - We propose a new space-time code (STC) structure that can achieve generalized optimal diversity (GOD) with a reduced design complexity, and also provide an increased cod...
Moon Il Lee, Seong Keun Oh, Dong Seung Kwon