1220 search results - page 234 / 244 » Restricting grammatical complexity |
139
click to vote
BTW
2009
Springer
15 years 24 days ago
2009
Springer
Abstract: Multimedia databases are increasingly common in science, business, entertainment and many other applications. Their size and high dimensionality of features are major cha...
101
click to vote
DAGM
2010
Springer
15 years 24 days 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...
ICML
2010
IEEE
15 years 23 days ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
103
click to vote
SIGCOMM
2010
ACM
14 years 12 months ago
2010
ACM
In this paper, we tackle challenges in migrating enterprise services into hybrid cloud-based deployments, where enterprise operations are partly hosted on-premise and partly in th...
SIGECOM
2010
ACM
14 years 12 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....