2890 search results - page 2 / 578 » A general framework for adaptive processing of data structur... |
121
Voted
VLDB
2002
ACM
15 years 2 months ago
2002
ACM
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...
159
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processe...
126
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In this paper, we rst present a theorem that HOSVD-based representation of high-order tensor data provides a robust framework that can be used for a uni ed representation of the H...
124
click to vote
ICDM
2008
IEEE
15 years 9 months ago
2008
IEEE
Supervised approaches to Data Mining are particularly appealing as they allow for the extraction of complex relations from data objects. In order to facilitate their application i...
126
Voted
SAC
2006
ACM
15 years 8 months ago
2006
ACM
We present an emotion recognition system based on a probabilistic approach to adaptive processing of Facial Emotion Tree Structures (FETS). FETS are made up of localized Gabor fea...