Sciweavers

3946 search results - page 113 / 790
» The computational complexity of choice sets
Sort
View
CISST
2003
83views Hardware» more  CISST 2003»
15 years 7 months ago
Computational Efficiency of Structural Image Matching
This paper addresses computational efficiency issues of a new algebraic method for imagery registration/conflation. An algebraic approach to conflation/registration of images does ...
Richard Chase, Boris Kovalerchuk
IPPS
2007
IEEE
16 years 24 days ago
A General Purpose Partially Reconfigurable Processor Simulator (PReProS)
An innovative technique to model and simulate partial and dynamic reconfigurable processors is presented in this paper. The basis for development is a SystemC kernel modified for ...
Alisson Vasconcelos De Brito, Matthias Kühnle...
VLDB
1995
ACM
132views Database» more  VLDB 1995»
15 years 10 months ago
Coloring Away Communication in Parallel Query Optimization
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on t...
Waqar Hasan, Rajeev Motwani
UAI
2008
15 years 8 months ago
The Phylogenetic Indian Buffet Process: A Non-Exchangeable Nonparametric Prior for Latent Features
Nonparametric Bayesian models are often based on the assumption that the objects being modeled are exchangeable. While appropriate in some applications (e.g., bag-ofwords models f...
Kurt T. Miller, Thomas L. Griffiths, Michael I. Jo...
JCB
2008
96views more  JCB 2008»
15 years 6 months ago
Computing Knock-Out Strategies in Metabolic Networks
Given a metabolic network in terms of its metabolites and reactions, our goal is to efficiently compute the minimal knock out sets of reactions required to block a given behaviour....
Utz-Uwe Haus, Steffen Klamt, Tamon Stephen