1679 search results - page 123 / 336 » Pointcuts as Functional Queries |
137
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
145
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
172
click to vote
CIDR
2011
14 years 8 months ago
2011
End-to-end data processing environments are often comprised of several independently-developed (sub-)systems, e.g. for engineering, organizational or historical reasons. Unfortuna...
150
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
231
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...