Sciweavers

271 search results - page 12 / 55
» Comparison of two interactive search refinement techniques
Sort
View
ICDE
2010
IEEE
210views Database» more  ICDE 2010»
15 years 2 months ago
IQ^P: Incremental Query Construction, a Probabilistic Approach
—This paper presents IQP - a novel approach to bridge the gap between usability of keyword search and expressiveness of database queries. IQP enables a user to start with an arbi...
Elena Demidova, Xuan Zhou, Wolfgang Nejdl
69
Voted
INFOVIS
2003
IEEE
15 years 2 months ago
Empirical Comparison of Dynamic Query Sliders and Brushing Histograms
Dynamic queries facilitate rapid exploration of information by real-time visual display of both query formulation and results. Dynamic query sliders are linked to the main visuali...
Qing Li, Chris North
SAC
2004
ACM
15 years 3 months ago
A comparison of randomized and evolutionary approaches for optimizing base station site selection
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
Larry Raisanen, Roger M. Whitaker, Steve Hurley
IAT
2008
IEEE
15 years 4 months ago
Comparison of Agent-Based and Population-Based Simulations of Displacement of Crime
Within Criminology, the process of crime displacement is usually explained by referring to the interaction of three types of agents: criminals, passersby, and guardians. Most exis...
Tibor Bosse, Charlotte Gerritsen, Mark Hoogendoorn...
STACS
1992
Springer
15 years 1 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...