Sciweavers

872 search results - page 155 / 175
» Extreme lower probabilities
Sort
View
ICDT
2007
ACM
121views Database» more  ICDT 2007»
15 years 3 months ago
Compact Samples for Data Dissemination
We consider data dissemination in a peer-to-peer network, where each user wishes to obtain some subset of the available information objects. In most of the modern algorithms for su...
Tova Milo, Assaf Sagi, Elad Verbin
HASKELL
2006
ACM
15 years 3 months ago
Statically typed linear algebra in Haskell
Many numerical algorithms are specified in terms of operations on vectors and matrices. Matrix operations can be executed extremely efficiently using specialized linear algebra k...
Frederik Eaton
ICCV
2005
IEEE
15 years 3 months ago
Perceptual Scale Space and its Applications
When an image is viewed at varying resolutions, it is known to create discrete perceptual jumps or transitions amid the continuous intensity changes. In this paper, we study a per...
Yizhou Wang, Siavosh Bahrami, Song Chun Zhu
CHES
2005
Springer
155views Cryptology» more  CHES 2005»
15 years 3 months ago
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
Willi Geiselmann, Adi Shamir, Rainer Steinwandt, E...
ISNN
2005
Springer
15 years 3 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu