Sciweavers

4911 search results - page 220 / 983
» Tree dependence analysis
Sort
View
150
Voted
ICSM
2007
IEEE
15 years 9 months ago
Computation of Static Execute After Relation with Applications to Software Maintenance
In this paper, we introduce Static Execute After (SEA) relationship among program components and present an efficient analysis algorithm. Our case studies show that SEA may appro...
Árpád Beszédes, Tamás ...
EUROPAR
2007
Springer
15 years 9 months ago
Delayed Side-Effects Ease Multi-core Programming
Computer systems are increasingly parallel and heterogeneous, while programs are still largely written in sequential languages. The obvious suggestion that the compiler should auto...
Anton Lokhmotov, Alan Mycroft, Andrew Richards
NIPS
1993
15 years 4 months ago
Credit Assignment through Time: Alternatives to Backpropagation
Learning to recognize or predict sequences using long-term context has many applications. However, practical and theoretical problems are found in training recurrent neural networ...
Yoshua Bengio, Paolo Frasconi
116
Voted
EACL
2006
ACL Anthology
15 years 4 months ago
Improving Probabilistic Latent Semantic Analysis with Principal Component Analysis
Probabilistic Latent Semantic Analysis (PLSA) models have been shown to provide a better model for capturing polysemy and synonymy than Latent Semantic Analysis (LSA). However, th...
Ayman Farahat, Francine Chen
SSDBM
2007
IEEE
111views Database» more  SSDBM 2007»
15 years 9 months ago
Duplicate Elimination in Space-partitioning Tree Indexes
Space-partitioning trees, like the disk-based trie, quadtree, kd-tree and their variants, are a family of access methods that index multi-dimensional objects. In the case of index...
Mohamed Y. Eltabakh, Mourad Ouzzani, Walid G. Aref