Sciweavers

1695 search results - page 48 / 339
» Interactive query refinement
Sort
View
SMA
2006
ACM
101views Solid Modeling» more  SMA 2006»
15 years 8 months ago
A higher dimensional formulation for robust and interactive distance queries
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
Joon-Kyung Seong, David E. Johnson, Elaine Cohen
113
Voted
PROCOMET
1998
15 years 3 months ago
Bisimulations in the join-calculus
We develop a theory of bisimulations in the join-calculus. We introduce a refined operational model that makes interactions with the environment explicit, and discuss the impact o...
Michele Boreale, Cédric Fournet, Cosimo Lan...
CIKM
2009
Springer
15 years 9 months ago
iPoG: fast interactive proximity querying on graphs
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...
Hanghang Tong, Huiming Qu, Hani Jamjoom, Christos ...
FQAS
2004
Springer
103views Database» more  FQAS 2004»
15 years 7 months ago
A Unifying Framework for Flexible Information Access in Taxonomy-Based Sources
A taxonomy-based source consists of a taxonomy and a database storing objects that are indexed in terms of the taxonomy. For this kind of sources, we describe a flexible interacti...
Yannis Tzitzikas, Carlo Meghini, Nicolas Spyratos
CIKM
2009
Springer
15 years 9 months ago
Applying differential privacy to search queries in a policy based interactive framework
Web search logs are of growing importance to researchers as they help understanding search behavior and search engine performance. However, search logs typically contain sensitive...
Palanivel Balaji Kodeswaran, Evelyne Viegas