358 search results - page 54 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
248
click to vote
ICDE
2005
IEEE
16 years 5 months ago
2005
IEEE
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...
140
click to vote
DAC
2006
ACM
16 years 5 months ago
2006
ACM
We propose a scalable and efficient parameterized block-based statistical static timing analysis algorithm incorporating both Gaussian and non-Gaussian parameter distributions, ca...
141
click to vote
COOPIS
1998
IEEE
15 years 8 months ago
1998
IEEE
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...
150
click to vote
ICIP
2009
IEEE
15 years 1 months ago
2009
IEEE
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...
158
Voted
RECOMB
2006
Springer
16 years 4 months ago
2006
Springer
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 ...