Sciweavers

1449 search results - page 153 / 290
» Finiteness results for sigmoidal
Sort
View
LPAR
2010
Springer
15 years 4 months ago
Counting and Enumeration Problems with Bounded Treewidth
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
CORR
2010
Springer
72views Education» more  CORR 2010»
15 years 3 months ago
X-Armed Bandits
We consider a generalization of stochastic bandit problems where the set of arms, X, is allowed to be a generic topological space. We constraint the mean-payoff function with a di...
Sébastien Bubeck, Rémi Munos, Gilles...
APIN
2002
121views more  APIN 2002»
15 years 6 months ago
Applying Learning by Examples for Digital Design Automation
This paper describes a new learning by example mechanism and its application for digital circuit design automation. This mechanism uses finite state machines to represent the infer...
Ben Choi
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 6 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
ICIP
2006
IEEE
16 years 8 months ago
Distributed Acquisition and Image Super-Resolution Based on Continuous Moments from Samples
Recently, new sampling schemes were presented for signals with finite rate of innovation (FRI) using sampling kernels reproducing polynomials or exponentials [1] [2]. In this pape...
Loïc Baboulaz, Pier Luigi Dragotti