Sciweavers

1912 search results - page 338 / 383
» On the evaluation of argumentation formalisms
Sort
View
POPL
2010
ACM
15 years 9 months ago
Monads in Action
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
Andrzej Filinski
KDD
2009
ACM
196views Data Mining» more  KDD 2009»
15 years 6 months ago
WhereNext: a location predictor on trajectory pattern mining
The pervasiveness of mobile devices and location based services is leading to an increasing volume of mobility data. This side effect provides the opportunity for innovative meth...
Anna Monreale, Fabio Pinelli, Roberto Trasarti, Fo...
CRV
2009
IEEE
115views Robotics» more  CRV 2009»
15 years 6 months ago
Learning Model Complexity in an Online Environment
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
Dan Levi, Shimon Ullman
QEST
2009
IEEE
15 years 6 months ago
Recent Extensions to Traviando
—Traviando is a trace analyzer and visualizer for simulation traces of discrete event dynamic systems. In this paper, we briefly outline recent extensions of Traviando towards a...
Peter Kemper
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
15 years 6 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng