3415 search results - page 128 / 683 » Lower Bounds for Kernelizations |
133
Voted
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
128
click to vote
TACAS
2009
Springer
15 years 11 months ago
2009
Springer
The ITPN-PerfBound is a tool for the modeling and analysis of Interval Time Petri Nets (ITPN), that is Petri Nets in which firing time intervals, and possibly firing frequency in...
129
click to vote
NIPS
2007
15 years 5 months ago
2007
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
140
click to vote
NIPS
2008
15 years 5 months ago
2008
We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a sample compression scheme. We show that this bound...
123
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
A private information retrieval scheme is a protocol whereby a client obtains a record from a database without the database operators learning anything about which record the clien...