Sciweavers

2069 search results - page 339 / 414
» Linear time algorithms for Clobber
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
CSDA
2006
108views more  CSDA 2006»
15 years 6 months ago
Repeated median and hybrid filters
Standard median filters preserve abrupt shifts (edges) and remove impulsive noise (outliers) from a constant signal but they deteriorate in trend periods. Finite impulse response ...
Roland Fried, Thorsten Bernholt, Ursula Gather
INFOCOM
1993
IEEE
15 years 10 months ago
Queueing Delays in Rate Controlled ATM Networks
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theore...
Anindo Banerjea, Srinivasan Keshav
ASIACRYPT
2008
Springer
15 years 8 months ago
Speeding Up the Pollard Rho Method on Prime Fields
Abstract. We propose a method to speed up the r-adding walk on multiplicative subgroups of the prime field. The r-adding walk is an iterating function used with the Pollard rho alg...
Jung Hee Cheon, Jin Hong, Minkyu Kim
IJCAI
2001
15 years 7 months ago
Market Clearability
Market mechanisms play a central role in AI as a coordination tool in multiagent systems and as an application area for algorithm design. Mechanisms where buyers are directly clea...
Tuomas Sandholm, Subhash Suri