Sciweavers

845 search results - page 138 / 169
» Connecting Many-Sorted Theories
Sort
View
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
13 years 10 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
13 years 10 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
FOIS
2006
13 years 10 months ago
Nontological Engineering
This article reflects an ongoing effort to systematize the use of terms applied by philosophers and computer scientists in the context of ontology and ontological engineering. We s...
Waclaw Kusnierczyk
ECIS
2001
13 years 10 months ago
Using Problem-Domain and Artefact-Domain Architectural Modelling to Understand System Evolution
The authors describe on going research to uncover the architectonic nature of artefacts and see how these may be related to high-level, but also grounded, model of the original pr...
Thomas R. Addis, Galal Hassan Galal
AAAI
1998
13 years 9 months ago
Boosting in the Limit: Maximizing the Margin of Learned Ensembles
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
Adam J. Grove, Dale Schuurmans