Sciweavers

569 search results - page 75 / 114
» An Empirical Study of Structural Constraint Solving Techniqu...
Sort
View
ICA
2010
Springer
13 years 7 months ago
Second Order Subspace Analysis and Simple Decompositions
Abstract. The recovery of the mixture of an N-dimensional signal generated by N independent processes is a well studied problem (see e.g. [1,10]) and robust algorithms that solve t...
Harold W. Gutch, Takanori Maehara, Fabian J. Theis
CIKM
2004
Springer
14 years 2 months ago
Evaluating window joins over punctuated streams
We explore join optimizations in the presence of both timebased constraints (sliding windows) and value-based constraints (punctuations). We present the first join solution named...
Luping Ding, Elke A. Rundensteiner
CAV
2004
Springer
151views Hardware» more  CAV 2004»
14 years 21 days ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...
COLING
1996
13 years 10 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
ECAI
2004
Springer
14 years 2 months ago
Towards Efficient Learning of Neural Network Ensembles from Arbitrarily Large Datasets
Advances in data collection technologies allow accumulation of large and high dimensional datasets and provide opportunities for learning high quality classification and regression...
Kang Peng, Zoran Obradovic, Slobodan Vucetic