Sciweavers

3223 search results - page 12 / 645
» The Scaling of Search Cost
Sort
View
JAIR
2000
123views more  JAIR 2000»
13 years 7 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
HICSS
2006
IEEE
143views Biometrics» more  HICSS 2006»
14 years 2 months ago
Assessment of Enterprise Information Security - The Importance of Information Search Cost
There are today several methods and standards available for assessment of the level of information security in an enterprise. A problem with these assessment methods is that they ...
Erik Johansson, Mathias Ekstedt, Pontus Johnson
PODS
1997
ACM
182views Database» more  PODS 1997»
14 years 5 days ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
ADBIS
2000
Springer
79views Database» more  ADBIS 2000»
14 years 10 days ago
Distributed Searching of k-Dimensional Data with Almost Constant Costs
Abstract. In this paper we consider the dictionary problem in the scalable distributed data structure paradigm introduced by Litwin, Neimat and Schneider and analyze costs for inse...
Adriano Di Pasquale, Enrico Nardelli
JCDL
2009
ACM
133views Education» more  JCDL 2009»
14 years 2 months ago
Cost and benefit analysis of mediated enterprise search
The utility of an enterprise search system is determined by three key players: the information retrieval (IR) system (the search engine), the enterprise users, and the service pro...
Mingfang Wu, James A. Thom, Andrew Turpin, Ross Wi...