Sciweavers

1679 search results - page 6 / 336
» Pointcuts as Functional Queries
Sort
View
WEBDB
2004
Springer
202views Database» more  WEBDB 2004»
14 years 22 days ago
Mining Approximate Functional Dependencies and Concept Similarities to Answer Imprecise Queries
Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest. In this paper we ...
Ullas Nambiar, Subbarao Kambhampati
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
11 years 9 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
SIGIR
2012
ACM
11 years 9 months ago
To index or not to index: time-space trade-offs in search engines with positional ranking functions
Positional ranking functions, widely used in web search engines, improve result quality by exploiting the positions of the query terms within documents. However, it is well known ...
Diego Arroyuelo, Senén González, Mau...
AOSD
2006
ACM
14 years 1 months ago
Expressing different conceptual models of join point selections in aspect-oriented design
When specifying pointcuts, i.e. join point selections, in AspectOriented Software Development, developers have in different situations different conceptual models in mind. Aspect-...
Dominik Stein, Stefan Hanenberg, Rainer Unland