Sciweavers

15254 search results - page 54 / 3051
» A k
Sort
View
JAR
2000
137views more  JAR 2000»
14 years 9 months ago
A Benchmark Method for the Propositional Modal Logics K, KT, S4
A lot of methods have been proposed -- and sometimes implemented -- for proof search in the propositional modal logics K, KT, and S4. It is difficult to compare the usefulness of ...
Peter Balsiger, Alain Heuerding, Stefan Schwendima...
JCIT
2010
174views more  JCIT 2010»
14 years 4 months ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
84
Voted
MICS
2010
124views more  MICS 2010»
14 years 4 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
ICDE
2009
IEEE
169views Database» more  ICDE 2009»
15 years 11 months ago
Visible Reverse k-Nearest Neighbor Queries
Reverse nearest neighbor (RNN) queries have a broad application base such as decision support, profile-based marketing, resource allocation, data mining, etc. Previous work on RNN ...
Yunjun Gao, Baihua Zheng, Gencai Chen, Wang-Chien ...
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
15 years 9 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...