Sciweavers

8294 search results - page 12 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
NIPS
2003
13 years 10 months ago
Fast Feature Selection from Microarray Expression Data via Multiplicative Large Margin Algorithms
New feature selection algorithms for linear threshold functions are described which combine backward elimination with an adaptive regularization method. This makes them particular...
Claudio Gentile
APGV
2010
ACM
266views Visualization» more  APGV 2010»
14 years 16 days ago
Horizon estimation: perceptual and computational experiments
The human visual system is able to quickly and robustly infer a wealth of scene information – the scene "gist" – already after 100 milliseconds of image presentation...
Christian Herdtweck, Christian Wallraven
ICAI
2010
13 years 6 months ago
An Efficient Sequential Covering Algorithm for Explaining Subsets of Data
Given a subset of data that differs from the rest, a user often wants an explanation as to why this is the case. For instance, in a database of flights, a user may want to understa...
Matthew Michelson, Sofus A. Macskassy
NAR
2007
135views more  NAR 2007»
13 years 8 months ago
g: Profiler - a web-based toolset for functional profiling of gene lists from large-scale experiments
g:Profiler (http://biit.cs.ut.ee/gprofiler/) is a public web server for characterising and manipulating gene lists resulting from mining high-throughput genomic data. g:Profiler h...
Jüri Reimand, Meelis Kull, Hedi Peterson, Jaa...
PPPJ
2006
ACM
14 years 2 months ago
Experiences with the development of a reverse engineering tool for UML sequence diagrams: a case study in modern Java developmen
The development of a tool for reconstructing UML sequence diagrams from executing Java programs is a challenging task. We implemented such a tool designed to analyze any kind of J...
Matthias Merdes, Dirk Dorsch