10608 search results - page 480 / 2122 » Complexity of O'Hara's Algorithm |
151
click to vote
ACSD
2009
IEEE
15 years 12 months ago
2009
IEEE
Asynchronous and latency-insensitive circuits offer a similar form of elasticity that tolerates variations in the delays of communication resources of a system. This flexibility ...
230
click to vote
GLOBECOM
2006
IEEE
15 years 11 months ago
2006
IEEE
— Lattice basis reduction is a powerful technique that enables a hard-output detector for a multiple-input multiple-output channel to approach maximum-likelihood performance with...
127
Voted
CTRSA
2007
Springer
15 years 9 months ago
2007
Springer
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...
120
click to vote
WSC
2000
15 years 6 months ago
2000
Investigation of the performance and operation of complex systems in manufacturing or other environments, analytical models of these systems become very complicated. Because of th...
280
Voted
ESA
2011
Springer
14 years 4 months ago
2011
Springer
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their ti...