Sciweavers

255 search results - page 37 / 51
» Approximate Tree Embedding Problem - An Algebraic Approach
Sort
View
PRL
2007
166views more  PRL 2007»
13 years 7 months ago
Boosted Landmarks of Contextual Descriptors and Forest-ECOC: A novel framework to detect and classify objects in cluttered scene
In this paper, we present a novel methodology to detect and recognize objects in cluttered scenes by proposing boosted contextual descriptors of landmarks in a framework of multi-...
Sergio Escalera, Oriol Pujol, Petia Radeva
TPDS
2008
175views more  TPDS 2008»
13 years 7 months ago
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
Olivier Beaumont, Larry Carter, Jeanne Ferrante, A...
JAIR
2010
145views more  JAIR 2010»
13 years 6 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
GPCE
2005
Springer
14 years 1 months ago
Generalized Type-Based Disambiguation of Meta Programs with Concrete Object Syntax
Abstract. In meta programming with concrete object syntax, object-level programs are composed from fragments written in concrete syntax. The use of small program fragments in such ...
Martin Bravenboer, Rob Vermaas, Jurgen J. Vinju, E...
IJIT
2004
13 years 9 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case