3368 search results - page 347 / 674 » The Complexity of Query Reliability |
164
click to vote
ICIW
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Peer-to-Peer (P2P) systems are widely used for sharing digital items without structured metadata and in absence of any kind of digital rights management applied to the d...
188
click to vote
ICCSA
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
196
click to vote
WINE
2007
Springer
16 years 23 days ago
2007
Springer
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
176
click to vote
DAWAK
2005
Springer
16 years 5 days ago
2005
Springer
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when querie...
180
click to vote
XSYM
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...