1679 search results - page 147 / 336 » Pointcuts as Functional Queries |
154
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
126
click to vote
IJCAI
1997
15 years 6 months ago
1997
Generating query-answering plans for information gathering agents requires to translate a user query, formulated in terms of a set of virtual relations, to a query that uses relat...
125
click to vote
IPM
2000
15 years 4 months ago
2000
In this paper, we present the system MULINEX, a fully implemented system which supports cross-lingual search of the WWW. Users can formulate, expand and disambiguate queries, filt...
159
Voted
PVLDB
2010
15 years 3 months ago
2010
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
138
Voted
SIGMOD
2004
ACM
16 years 5 months ago
2004
ACM
Existing methods for prediction in spatio-temporal databases assume that objects move according to linear functions. This severely limits their applicability, since in practice mo...