Sciweavers

1686 search results - page 217 / 338
» Programs as polygraphs: computability and complexity
Sort
View
IDA
2009
Springer
15 years 10 months ago
Canonical Dual Approach to Binary Factor Analysis
Abstract. Binary Factor Analysis (BFA) is a typical problem of Independent Component Analysis (ICA) where the signal sources are binary. Parameter learning and model selection in B...
Ke Sun, Shikui Tu, David Yang Gao, Lei Xu
MDM
2009
Springer
123views Communications» more  MDM 2009»
15 years 10 months ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...
IPPS
2007
IEEE
15 years 10 months ago
An Optimizing Compiler for Parallel Chemistry Simulations
Well designed domain specific languages enable the easy expression of problems, the application of domain specific optimizations, and dramatic improvements in productivity for t...
Jun Cao, Ayush Goyal, Samuel P. Midkiff, James M. ...
NOCS
2007
IEEE
15 years 10 months ago
Towards Open Network-on-Chip Benchmarks
Measuring and comparing performance, cost, and other features of advanced communication architectures for complex multi core/multiprocessor systems on chip is a significant challe...
Cristian Grecu, André Ivanov, Partha Pratim...
AINA
2005
IEEE
15 years 9 months ago
Relational Database Operations Modeling with UML
Many existing software applications involve complex application layer implemented in OO programming languages and at the same time use relational database systems as back-end data...
Shuxin Yin, Indrakshi Ray