Sciweavers

59 search results - page 9 / 12
» The Many Facets of Approximate Similarity Search
Sort
View
ECAI
2008
Springer
14 years 11 months ago
Towards Efficient Belief Update for Planning-Based Web Service Composition
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
Jörg Hoffmann
93
Voted
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
14 years 11 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
BTW
2007
Springer
183views Database» more  BTW 2007»
15 years 1 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
87
Voted
TOIS
2008
145views more  TOIS 2008»
14 years 9 months ago
Classification-aware hidden-web text database selection
Many valuable text databases on the web have non-crawlable contents that are "hidden" behind search interfaces. Metasearchers are helpful tools for searching over multip...
Panagiotis G. Ipeirotis, Luis Gravano
DASFAA
2008
IEEE
190views Database» more  DASFAA 2008»
15 years 4 months ago
Analysis of Time Series Using Compact Model-Based Descriptions
Abstract. Recently, we have proposed a novel method for the compression of time series based on mathematical models that explore dependencies between different time series. This r...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...