Sciweavers

1117 search results - page 80 / 224
» Equivalent Representations of Set Functions
Sort
View
CAIP
2005
Springer
260views Image Analysis» more  CAIP 2005»
15 years 3 months ago
An Illumination Invariant Face Recognition Approach Using Exemplar-Based Synthesis Technique
Abstract. This paper proposes a new method to solve the problem of face recognition under varying illumination conditions. We introduce an exemplar-based technique to decouple and ...
Tele Tan, Thorsten Kühnapfel, Amelyn Wongso, ...
CORR
2008
Springer
92views Education» more  CORR 2008»
14 years 9 months ago
A connection between palindromic and factor complexity using return words
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...
Michelangelo Bucci, Alessandro De Luca, Amy Glen, ...
SYNTHESE
2008
81views more  SYNTHESE 2008»
14 years 9 months ago
Decision framing in judgment aggregation
Judgment aggregation problems are language dependent in that they may be framed in different yet equivalent ways. We formalize this dependence via the notion of translation invari...
Fabrizio Cariani, Marc Pauly, Josh Snyder
SIGMOD
2008
ACM
203views Database» more  SIGMOD 2008»
15 years 9 months ago
Querying continuous functions in a database system
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
Arvind Thiagarajan, Samuel Madden
FLOPS
2008
Springer
14 years 11 months ago
Rewriting and Call-Time Choice: The HO Case
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
Francisco Javier López-Fraguas, Juan Rodr&i...