Sciweavers

1941 search results - page 178 / 389
» The representation of planning strategies
Sort
View
ICDE
2001
IEEE
163views Database» more  ICDE 2001»
16 years 8 months ago
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
Douglas Burdick, Manuel Calimlim, Johannes Gehrke
JCDL
2004
ACM
89views Education» more  JCDL 2004»
15 years 12 months ago
Machine learning for information architecture in a large governmental website
This paper describes ongoing research into the application of machine learning techniques for improving access to governmental information in complex digital libraries. Under the ...
Miles Efron, Jonathan L. Elsas, Gary Marchionini, ...
ENTCS
2008
91views more  ENTCS 2008»
15 years 6 months ago
Towards Concrete Syntax Patterns for Logic-based Transformation Rules
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
Malte Appeltauer, Günter Kniesel
PR
2006
101views more  PR 2006»
15 years 6 months ago
Feature-based approach to semi-supervised similarity learning
For the management of digital document collections, automatic database analysis still has ties to deal with semantic queries and abstract concepts that users are looking for. When...
Philippe Henri Gosselin, Matthieu Cord
PG
2007
IEEE
16 years 25 days ago
Point-Based Minkowski Sum Boundary
Minkowski sum is a fundamental operation in many geometric applications, including robotics, penetration depth estimation, solid modeling, and virtual prototyping. However, due to...
Jyh-Ming Lien