507 search results - page 98 / 102 » Computing Sparse Multiples of Polynomials |
117
click to vote
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
105
click to vote
ARESEC
2011
13 years 9 months ago
2011
—Denial of Service (DoS) attacks aiming to exhaust the resources of a server by overwhelming it with bogus requests have become a serious threat. Especially protocols that rely o...
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
This paper proposes a joint feature-based model indexing and geometric constraint based alignment pipeline for efficient and accurate recognition of 3D objects from a large model ...
171
Voted
ICDE
2005
IEEE
15 years 11 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...
103
click to vote
MOBIHOC
2005
ACM
15 years 9 months ago
2005
ACM
The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels ca...