Sciweavers

2880 search results - page 106 / 576
» Approximate Range Searching
Sort
View
COOPIS
2004
IEEE
15 years 7 months ago
Supporting Similarity Operations Based on Approximate String Matching on the Web
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...
Eike Schallehn, Ingolf Geist, Kai-Uwe Sattler
ENTCS
2006
134views more  ENTCS 2006»
15 years 3 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
MP
2002
84views more  MP 2002»
15 years 3 months ago
A decomposition procedure based on approximate Newton directions
The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analy...
Antonio J. Conejo, Francisco J. Nogales, Francisco...
126
Voted
WAPCV
2007
Springer
15 years 9 months ago
An Information Theoretic Model of Saliency and Visual Search
In this paper, a proposal which quantifies visual saliency based on an information theoretic definition is evaluated with respect to visual psychophysics paradigms. Analysis reve...
Neil D. B. Bruce, John K. Tsotsos
226
Voted
VLDB
2007
ACM
169views Database» more  VLDB 2007»
16 years 3 months ago
Peer-to-Peer Similarity Search in Metric Spaces
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
Christos Doulkeridis, Akrivi Vlachou, Yannis Kotid...