Sciweavers

1887 search results - page 244 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
ECAI
2004
Springer
14 years 2 months ago
IPSS: A Hybrid Reasoner for Planning and Scheduling
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
María Dolores Rodríguez-Moreno, Ange...
ICDE
1999
IEEE
134views Database» more  ICDE 1999»
14 years 10 months ago
On Similarity-Based Queries for Time Series Data
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence. We hav...
Davood Rafiei
KDD
2009
ACM
229views Data Mining» more  KDD 2009»
14 years 9 months ago
An association analysis approach to biclustering
The discovery of biclusters, which denote groups of items that show coherent values across a subset of all the transactions in a data set, is an important type of analysis perform...
Gaurav Pandey, Gowtham Atluri, Michael Steinbach, ...
CINQ
2004
Springer
125views Database» more  CINQ 2004»
14 years 2 months ago
The Hows, Whys, and Whens of Constraints in Itemset and Rule Discovery
Many researchers in our community (this author included) regularly emphasize the role constraints play in improving performance of data-mining algorithms. This emphasis has led to ...
Roberto J. Bayardo
ICDM
2007
IEEE
176views Data Mining» more  ICDM 2007»
14 years 1 months ago
A Compact Representation of Spatio-Temporal Data
As technology advances we encounter more available data on moving objects, which can be mined to our benefit. In order to efficiently mine this large amount of data we propose an ...
Sigal Elnekave, Mark Last, Oded Maimon