Sciweavers

580 search results - page 36 / 116
» An Efficient Implementation of an Active Set Method for SVMs
Sort
View
ISCC
2000
IEEE
13 years 11 months ago
An Efficient and Flexible Late Join Algorithm for Interactive Shared Whiteboards
In this paper we propose a novel late join algorithm for distributed applications with a fully replicated architecture (e.g. shared whiteboards). The term `late join algorithm'...
Werner Geyer, Jürgen Vogel, Martin Mauve
BMCBI
2007
106views more  BMCBI 2007»
13 years 7 months ago
Simultaneous identification of long similar substrings in large sets of sequences
Background: Sequence comparison faces new challenges today, with many complete genomes and large libraries of transcripts known. Gene annotation pipelines match these sequences in...
Jürgen Kleffe, Friedrich Möller, Burghar...
AAAI
2000
13 years 9 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
ICPR
2002
IEEE
14 years 8 months ago
A Computationally Efficient Approach to Indoor/Outdoor Scene Classification
Prior research in scene classification has shown that high-level information can be inferred from low-level image features. Classification rates of roughly 90% have been reported ...
Navid Serrano, Andreas E. Savakis, Jiebo Luo
JOCN
2010
70views more  JOCN 2010»
13 years 6 months ago
Optimizing Design Efficiency of Free Recall Events for fMRI
■ Free recall is a fundamental paradigm for studying memory retrieval in the context of minimal cue support. Accordingly, free recall has been extensively studied using behavior...
Ilke Öztekin, Nicole M. Long, David Badre