Sciweavers

2130 search results - page 96 / 426
» Visual query suggestion
Sort
View
APPROX
2004
Springer
88views Algorithms» more  APPROX 2004»
15 years 3 months ago
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...
Andrej Bogdanov, Hoeteck Wee
BNCOD
2004
184views Database» more  BNCOD 2004»
14 years 11 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank
RIAO
2004
14 years 11 months ago
Subject Knowledge, Thesaurus-assisted Query Expansion and Search Success
This study explored how experts and novices in pedagogics expanded queries supported by the ERIC thesaurus, and how this was connected to the search success in an easy and a diffi...
Anne Sihvonen, Pertti Vakkari
CCR
2008
112views more  CCR 2008»
14 years 10 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...
CORR
2010
Springer
66views Education» more  CORR 2010»
14 years 10 months ago
Query strategy for sequential ontology debugging
Abstract. Debugging is an important prerequisite for the wide-spread application of ontologies, especially in areas that rely upon everyday users to create and maintain knowledge b...
Kostyantyn M. Shchekotykhin, Gerhard Friedrich