Sciweavers

1699 search results - page 328 / 340
» A Rule Format for Associativity
Sort
View
AI
2003
Springer
14 years 18 days ago
Negotiating Exchanges of Private Information for Web Service Eligibility
Private information about individuals that engage in e-commerce business transactions is of economic value to businesses for market analysis and for identifying possible future par...
Keping Jia, Bruce Spencer
HIPC
2003
Springer
14 years 17 days ago
Parallel and Distributed Frequent Itemset Mining on Dynamic Datasets
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...
Adriano Veloso, Matthew Eric Otey, Srinivasan Part...
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
14 years 9 days ago
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov
MPC
2010
Springer
152views Mathematics» more  MPC 2010»
14 years 4 days ago
Lucy-n: a n-Synchronous Extension of Lustre
Synchronous functional languages such as Lustre or Lucid Synchrone define a restricted class of Kahn Process Networks which can be executed with no buffer. Every expression is as...
Louis Mandel, Florence Plateau, Marc Pouzet
ICFP
1999
ACM
13 years 11 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil