Sciweavers

444 search results - page 55 / 89
» More Colourful Simplices
Sort
View
DC
2001
15 years 1 months ago
Mixing and Mapping Metadata to Provide Integrated Access to Digital Library Collections: An Activity Report
This paper provides a report of work in progress to implement integrated access to multiple digital collections that are described using a variety of metadata formats. Using the e...
Karen Calhoun, Tom Turner, Meryl Brodsky, George K...
DMDW
2001
307views Management» more  DMDW 2001»
15 years 1 months ago
An Analysis of Many-to-Many Relationships Between Fact and Dimension Tables in Dimensional Modeling
Star schema, which maintains one-to-many relationships between dimensions and a fact table, is widely accepted as the most viable data representation for dimensional analysis. Rea...
Il-Yeol Song, William Rowen, Carl Medsker, Edward ...
ACL
1989
15 years 1 months ago
The Structure of Shared Forests in Ambiguous Parsing
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
Sylvie Billot, Bernard Lang
HPDC
2010
IEEE
15 years 27 days ago
Twister: a runtime for iterative MapReduce
MapReduce programming model has simplified the implementation of many data parallel applications. The simplicity of the programming model and the quality of services provided by m...
Jaliya Ekanayake, Hui Li, Bingjing Zhang, Thilina ...
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 27 days ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt