Sciweavers

358 search results - page 54 / 72
» On the Distributed Complexity of Computing Maximal Matchings
Sort
View
ICDE
2005
IEEE
144views Database» more  ICDE 2005»
16 years 3 months ago
ViteX: A Streaming XPath Processing System
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
Yi Chen, Susan B. Davidson, Yifeng Zheng
121
Voted
DAC
2006
ACM
16 years 2 months ago
Statistical timing analysis with correlated non-gaussian parameters using independent component analysis
We propose a scalable and efficient parameterized block-based statistical static timing analysis algorithm incorporating both Gaussian and non-Gaussian parameter distributions, ca...
Jaskirat Singh, Sachin S. Sapatnekar
COOPIS
1998
IEEE
15 years 6 months ago
A Generative Communication Service for Database Interoperability
Parallel and distributed programming is conceptually harder to undertake and to understand than sequential programming, because a programmer often has to manage the coexistence an...
Wilhelm Hasselbring, Mark Roantree
ICIP
2009
IEEE
14 years 11 months ago
Robust 3D pose estimation from multiple video cameras
In this paper, we introduce a method to estimate the object's pose from multiple video cameras. We derive a centralized solution to pose estimation from multiple video camera...
Chong Chen, Dan Schonfeld
RECOMB
2006
Springer
16 years 2 months ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger