Sciweavers

3108 search results - page 198 / 622
» The Elements of Computer Credibility
Sort
View
CIE
2009
Springer
16 years 25 days ago
Decidability of Sub-theories of Polynomials over a Finite Field
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
Alla Sirokofskich
ICPR
2008
IEEE
16 years 21 days ago
Film shot classification using directing semantics
We propose a film directing semantics taxonomy grounded upon cinematographic elements to unlock the immense potential for motion indexing in the subtler and much neglected film do...
Hee Lin Wang, Loong Fah Cheong
ISMAR
2008
IEEE
16 years 19 days ago
The haunted book
This paper describes an artwork that relies on recent Computer Vision and Augmented Reality techniques to animate the illustrations of a poetry book. Because we don’t need marke...
Camille Scherrer, Julien Pilet, Pascal Fua, Vincen...
DBPL
2007
Springer
102views Database» more  DBPL 2007»
16 years 12 days ago
A Theory of Stream Queries
Data streams are modeled as infinite or finite sequences of data elements coming from an arbitrary but fixed universe. The universe can have various built-in functions and predi...
Yuri Gurevich, Dirk Leinders, Jan Van den Bussche
150
Voted
FCT
2007
Springer
16 years 12 days ago
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...