Sciweavers

10182 search results - page 1966 / 2037
» Case Studies
Sort
View
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 5 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
COCOON
2003
Springer
15 years 5 months ago
Graph Coloring and the Immersion Order
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
Faisal N. Abu-Khzam, Michael A. Langston
CRYPTO
2003
Springer
137views Cryptology» more  CRYPTO 2003»
15 years 5 months ago
New Partial Key Exposure Attacks on RSA
Abstract. In 1998, Boneh, Durfee and Frankel [4] presented several attacks on RSA when an adversary knows a fraction of the secret key bits. The motivation for these so-called part...
Johannes Blömer, Alexander May
IBPRIA
2003
Springer
15 years 5 months ago
Does Independent Component Analysis Play a~Role in Unmixing Hyperspectral Data?
—Independent component analysis (ICA) has recently been proposed as a tool to unmix hyperspectral data. ICA is founded on two assumptions: 1) the observed spectrum vector is a li...
José M. P. Nascimento, José M. B. Di...
CF
2010
ACM
15 years 5 months ago
EXACT: explicit dynamic-branch prediction with active updates
Branches that depend directly or indirectly on load instructions are a leading cause of mispredictions by state-of-the-art branch predictors. For a branch of this type, there is a...
Muawya Al-Otoom, Elliott Forbes, Eric Rotenberg
« Prev « First page 1966 / 2037 Last » Next »