Sciweavers

1174 search results - page 92 / 235
» Optimizing generics is easy!
Sort
View
ISMVL
1994
IEEE
124views Hardware» more  ISMVL 1994»
14 years 2 months ago
Approximating Propositional Calculi by Finite-Valued Logics
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...
Matthias Baaz, Richard Zach
NIPS
2004
13 years 11 months ago
Supervised Graph Inference
We formulate the problem of graph inference where part of the graph is known as a supervised learning problem, and propose an algorithm to solve it. The method involves the learni...
Jean-Philippe Vert, Yoshihiro Yamanishi
IJVR
2006
113views more  IJVR 2006»
13 years 10 months ago
The Virtual Human Platform: Simplifying the Use of Virtual Characters
In this paper, we will explain our approach to create and animate virtual characters for real-time rendering applications in an easy and intuitive way. Furthermore we show a way ho...
Christian Knöpfle, Yvonne Jung
TCS
2008
13 years 10 months ago
Dense open-shop schedules with release times
We study open-shop scheduling problems with job release times. The objective is to minimize the makespan. Dense schedules, easy to construct, are often used as approximate solutio...
Rongjun Chen, Wanzhen Huang, Guochun Tang
CAIP
1999
Springer
115views Image Analysis» more  CAIP 1999»
14 years 2 months ago
EigenHistograms: Using Low Dimensional Models of Color Distribution for Real Time Object Recognition
Abstract. Distribution of object colors has been used in computer vision for recognition and indexing. Most of the recent approaches to this problem have been focused on de ning op...
Jordi Vitrià, Petia Radeva, Xavier Binefa