1679 search results - page 57 / 336 » Pointcuts as Functional Queries |
118
Voted
STOC
2004
ACM
16 years 1 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
195
click to vote
SIGMOD
2007
ACM
16 years 27 days ago
2007
ACM
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
137
click to vote
COLT
2010
Springer
14 years 10 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
122
Voted
SG
2010
Springer
15 years 5 months ago
2010
Springer
While many visualization tools exist that offer sophisticated functions for charting complex data, they still expect users to possess a high degree of expertise in wielding the to...
126
Voted
SIGMOD
2003
ACM
16 years 27 days ago
2003
ACM
Database queries often take the form of correlated SQL queries. Correlation refers to the use of values from the outer query block to compute the inner subquery. This is a conveni...