Sciweavers

2107 search results - page 74 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
ICWE
2004
Springer
15 years 11 months ago
Automatic Interpretation of Natural Language for a Multimedia E-learning Tool
Abstract. This paper describes the new e-learning tool CHESt that allows students to search in a knowledge base for short (teaching) multimedia clips by using a semantic search eng...
Serge Linckels, Christoph Meinel
CVPR
2007
IEEE
16 years 8 months ago
Linear and Quadratic Subsets for Template-Based Tracking
We propose a method that dramatically improves the performance of template-based matching in terms of size of convergence region and computation time. This is done by selecting a ...
Selim Benhimane, Alexander Ladikos, Vincent Lepeti...
AAAI
2008
15 years 8 months ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
RANDOM
2001
Springer
15 years 10 months ago
Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
Susanne Albers, Carsten Witt
WWW
2004
ACM
16 years 6 months ago
Propagation of trust and distrust
A (directed) network of people connected by ratings or trust scores, and a model for propagating those trust scores, is a fundamental building block in many of today's most s...
Ramanathan V. Guha, Ravi Kumar, Prabhakar Raghavan...