Sciweavers

8067 search results - page 707 / 1614
» A Model Proposal of the Interoperability Problem
Sort
View
194
Voted
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 11 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
CSR
2006
Springer
15 years 11 months ago
Incremental Branching Programs
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
Anna Gál, Michal Koucký, Pierre McKe...
204
Voted
CAV
2008
Springer
96views Hardware» more  CAV 2008»
15 years 9 months ago
Implied Set Closure and Its Application to Memory Consistency Verification
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
Surender Baswana, Shashank K. Mehta, Vishal Powar
SDM
2010
SIAM
149views Data Mining» more  SDM 2010»
15 years 8 months ago
Temporal Collaborative Filtering with Bayesian Probabilistic Tensor Factorization
Real-world relational data are seldom stationary, yet traditional collaborative filtering algorithms generally rely on this assumption. Motivated by our sales prediction problem, ...
Liang Xiong, Xi Chen, Tzu-Kuo Huang, Jeff Schneide...
219
Voted
MASCOTS
2010
15 years 5 months ago
Cluster-Based Correlated Data Gathering in Wireless Sensor Networks
—We consider the problem of optimal cluster-based data gathering in Wireless Sensor Networks (WSNs) when nearby readings are spatially correlated. Due to the dense nature of WSNs...
Ali Dabirmoghaddam, Majid Ghaderi, Carey L. Willia...