4067 search results - page 546 / 814 » Programs for Applying Symmetries |
206
click to vote
IPCO
2008
15 years 8 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
156
click to vote
NIPS
2008
15 years 8 months ago
2008
We introduce a novel framework for estimating vector fields using sparse basis field expansions (S-FLEX). The notion of basis fields, which are an extension of scalar basis functi...
126
click to vote
SNPD
2007
15 years 8 months ago
2007
As malicious code has become more sophisticated and pervasive, faster and more effective system for forensics and prevention is important. Particularly, quick analysis of polymorp...
169
click to vote
AAAI
2004
15 years 8 months ago
2004
The search for finite-state controllers for partially observable Markov decision processes (POMDPs) is often based on approaches like gradient ascent, attractive because of their ...
190
click to vote
AAAI
2006
15 years 8 months ago
2006
Intelligent agents must be able to handle the complexity and uncertainty of the real world. Logical AI has focused mainly on the former, and statistical AI on the latter. Markov l...