Sciweavers

10608 search results - page 122 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ICDIM
2008
IEEE
14 years 4 months ago
A fast approximate algorithm for large-scale Latent Semantic Indexing
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
Dell Zhang, Zheng Zhu
IPPS
2007
IEEE
14 years 4 months ago
STAMP: A Universal Algorithmic Model for Next-Generation Multithreaded Machines and Systems
We propose a generic algorithmic model called STAMP (Synchronous, Transactional, and Asynchronous MultiProcessing) as a universal performance and power complexity model for multit...
Michel Dubois, Hyunyoung Lee, Lan Lin
COCO
2001
Springer
154views Algorithms» more  COCO 2001»
14 years 2 months ago
Quantum Algorithms for Element Distinctness
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
Harry Buhrman, Christoph Dürr, Mark Heiligman...
STOC
2001
ACM
129views Algorithms» more  STOC 2001»
14 years 10 months ago
Interaction in quantum communication and the complexity of set disjointness
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...
Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David...
GLOBECOM
2008
IEEE
14 years 4 months ago
A Low-Complexity Iterative Channel Estimation and Detection Technique for Doubly Selective Channels
— In this paper, we propose a low-complexity iterative joint channel estimation, detection and decoding technique for doubly selective channels. The key is a segment-by-segment f...
Qinghua Guo, Ping Li