Sciweavers

874 search results - page 33 / 175
» Computing Weighted Solutions in Answer Set Programming
Sort
View
SOFSEM
2007
Springer
14 years 4 months ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach
ICPR
2002
IEEE
14 years 11 months ago
A Windowed Weighted Approach for Approximate Cyclic String Matching
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
Ramón Alberto Mollineda, Enrique Vidal, Fra...
MDM
2009
Springer
123views Communications» more  MDM 2009»
14 years 5 months ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...
DIS
2010
Springer
13 years 8 months ago
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Mas...
SSDBM
2007
IEEE
118views Database» more  SSDBM 2007»
14 years 5 months ago
Database Support for Weighted Match Joins
As relational database management systems are applied to non-traditional domains such as scientific data management, there is an increasing need to support queries with semantics ...
Ameet Kini, Jeffrey F. Naughton