Sciweavers

14 search results - page 3 / 3
» Totally Monotone Core and Products of Monotone Measures
Sort
View
STACS
1999
Springer
13 years 10 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
ISAAC
2005
Springer
138views Algorithms» more  ISAAC 2005»
13 years 11 months ago
On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
Zhixiang Chen, Bin Fu
CORR
2008
Springer
154views Education» more  CORR 2008»
13 years 5 months ago
Sponsored Search Auctions with Markovian Users
Abstract. Sponsored search involves running an auction among advertisers who bid in order to have their ad shown next to search results for specific keywords. The most popular auct...
Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Mar...
ISCAS
2006
IEEE
81views Hardware» more  ISCAS 2006»
13 years 11 months ago
Fully programmable bias current generator with 24 bit resolution per bias
This paper describes an on-chip programmable bias current generator, intended for mixed signal chips requiring a wide ranging set of currents. The individual generators share a ma...
Tobi Delbrück, Patrick Lichtsteiner