Sciweavers

3368 search results - page 88 / 674
» The Complexity of Query Reliability
Sort
View
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 9 months ago
Inverting a permutation is as hard as unordered search
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
Ashwin Nayak
DEXAW
2005
IEEE
155views Database» more  DEXAW 2005»
14 years 2 months ago
MediaPeer: A Safe, Scalable P2P Architecture for XML Query Processing
Increasing popularity of XML and P2P networks has generated much interest in distributed processing of XML data. We propose a novel solution organized around a mediator capable of...
Florin Dragan, Georges Gardarin, Laurent Yeh
CCR
2008
112views more  CCR 2008»
13 years 9 months ago
Empirical evaluation of querying mechanisms for unstructured wireless sensor networks
In the last few years, several studies have analyzed the performance of flooding and random walks as querying mechanisms for unstructured wireless sensor networks. However, most o...
Joon Ahn, Shyam Kapadia, Sundeep Pattem, Avinash S...
MOBIDE
2006
ACM
14 years 2 months ago
Evaluation of probabilistic queries in moving objects databases
The representation of moving objects in spatial database systems has become an important research topic in recent years. As it is not realistic to track and store the location of ...
Talel Abdessalem, Laurent Decreusefond, José...
ECIR
2010
Springer
13 years 10 months ago
Improving Retrievability of Patents in Prior-Art Search
Prior-art search is an important task in patent retrieval. The success of this task relies upon the selection of relevant search queries. Typically terms for prior-art queries are ...
Shariq Bashir, Andreas Rauber