7106 search results - page 302 / 1422 » Restricted Complexity, General Complexity |
148
click to vote
IMC
2007
ACM
15 years 6 months ago
2007
ACM
This work was motivated by a discussion that two of the coauthors (computer science professors) had with the other coauthor (a law professor and a former computer crime Trial Atto...
126
click to vote
NIPS
2007
15 years 6 months ago
2007
We propose a Gaussian process (GP) framework for robust inference in which a GP prior on the mixing weights of a two-component noise model augments the standard process over laten...
145
click to vote
DAGM
2010
Springer
15 years 5 months ago
2010
Springer
Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristi...
138
click to vote
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
155
click to vote
COMGEO
2010
ACM
15 years 4 months ago
2010
ACM
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...