Sciweavers

6274 search results - page 294 / 1255
» From query complexity to computational complexity
Sort
View
ICIP
2003
IEEE
16 years 7 months ago
Fast Feldkamp algorithm for cone-beam computer tomography
We propose a new fast Feldkamp algorithm for 3-D cone beam tomography with a circular source trajectory. The algorithm is an extension of our recent fast native 2-D fan-beam recon...
Shu Xiao, Yoram Bresler, David C. Munson Jr.
149
Voted
SEMWEB
2009
Springer
16 years 20 days ago
Parallelization and Distribution Techniques for Ontology Matching in Urban Computing Environments
The usage of parallelization and distribution techniques in the field of ontology matching is of high interest for the semantic web community. This work presents an approach for ma...
Axel Tenschert, Matthias Assel, Alexey Cheptsov, G...
IJCNN
2006
IEEE
16 years 5 days ago
Computational Neurogenetic Modeling: A Methodology to Study Gene Interactions Underlying Neural Oscillations
—We present new results from Computational Neurogenetic Modeling to aid discoveries of complex gene interactions underlying oscillations in neural systems. Interactions of genes ...
Lubica Benuskova, Simei Gomes Wysoski, Nikola K. K...
INFOCOM
2003
IEEE
15 years 11 months ago
Computing the Types of the Relationships between Autonomous Systems
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
Giuseppe Di Battista, Maurizio Patrignani, Maurizi...
160
Voted
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
15 years 8 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb