Sciweavers

1688 search results - page 79 / 338
» The Complexity of Rationalizing Matchings
Sort
View
ICASSP
2010
IEEE
13 years 8 months ago
Flexible complex ICA of fMRI data
Data-driven analysis methods, in particular independent component analysis (ICA) has proven quite useful for the analysis of functional magnetic imaging (fMRI) data. In addition, ...
Hualiang Li, Tülay Adali, Nicolle M. Correa, ...
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
14 years 10 months ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
14 years 10 months ago
High-performance complex event processing over streams
In this paper, we present the design, implementation, and evaluation of a system that executes complex event queries over real-time streams of RFID readings encoded as events. The...
Eugene Wu 0002, Yanlei Diao, Shariq Rizvi
FCT
2005
Springer
14 years 3 months ago
On the Black-Box Complexity of Sperner's Lemma
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
PODS
2008
ACM
141views Database» more  PODS 2008»
14 years 10 months ago
On the complexity of deriving schema mappings from database instances
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
Pierre Senellart, Georg Gottlob