Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,018
SPADE: An efficient algorithm for mining frequent sequences
- Machine Learning
, 2001
"... Abstract. In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex hash structures which have poor locality. SPADE utilizes combinatorial properties to decompose the original proble ..."
Abstract
-
Cited by 437 (16 self)
- Add to MetaCart
, and by an order of magnitude with some pre-processed data. It also has linear scalability with respect to the number of input-sequences, and a number of other database parameters. Finally, we discuss how the results of sequence mining can be applied in a real application domain.
Lightweight probabilistic broadcast
- ACM Transaction on Computer Systems
, 2003
"... The growing interest in peer-to-peer applications has underlined the importance of scalability in modern distributed systems. Not surprisingly, much research effort has been invested in gossip-based broadcast protocols. These trade the traditional strong reliability guarantees against very good “sca ..."
Abstract
-
Cited by 302 (35 self)
- Add to MetaCart
The growing interest in peer-to-peer applications has underlined the importance of scalability in modern distributed systems. Not surprisingly, much research effort has been invested in gossip-based broadcast protocols. These trade the traditional strong reliability guarantees against very good
A finite-volume, incompressible Navier–Stokes model for studies of the ocean on parallel computers.
- J. Geophys. Res.,
, 1997
"... Abstract. The numerical implementation of an ocean model based on the incompressible Navier Stokes equations which is designed for studies of the ocean circulation on horizontal scales less than the depth of the ocean right up to global scale is described. A "pressure correction" method i ..."
Abstract
-
Cited by 293 (32 self)
- Add to MetaCart
columns of ocean to each processing unit. The resulting model, which can handle arbitrarily complex geometry, is efficient and scalable and has been mapped on to massively parallel multiprocessors such as the Connection Machine (CM5) using data-parallel FORTRAN and the Massachusetts Institute
Scalable Parallel Data Mining for Association Rules
, 1997
"... One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consuming operation in this discovery process is the computation of the frequency of the occurrences of interesting subset of ..."
Abstract
-
Cited by 181 (12 self)
- Add to MetaCart
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consuming operation in this discovery process is the computation of the frequency of the occurrences of interesting subset
A Distributed Resource Management Architecture that Supports Advance Reservations and Co-Allocation
"... The realization of end-to-end quality of service (QoS) guarantees in emerging network-based applications requires mechanisms that support first dynamic discovery and then advance or immediate reservation of resources that will often be heterogeneous in type and implementation and independently contr ..."
Abstract
-
Cited by 245 (26 self)
- Add to MetaCart
The realization of end-to-end quality of service (QoS) guarantees in emerging network-based applications requires mechanisms that support first dynamic discovery and then advance or immediate reservation of resources that will often be heterogeneous in type and implementation and independently
The induction of dynamical recognizers
- Machine Learning
, 1991
"... A higher order recurrent neural network architecture learns to recognize and generate languages after being "trained " on categorized exemplars. Studying these networks from the perspective of dynamical systems yields two interesting discoveries: First, a longitudinal examination of the le ..."
Abstract
-
Cited by 225 (14 self)
- Add to MetaCart
A higher order recurrent neural network architecture learns to recognize and generate languages after being "trained " on categorized exemplars. Studying these networks from the perspective of dynamical systems yields two interesting discoveries: First, a longitudinal examination
METEOR-S WSDI: A Scalable P2P Infrastructure of Registries for Semantic Publication and Discovery of Web services
- Journal of Information Technology and Management
, 2005
"... Web services are the new paradigm for distributed computing. They have much to offer towards interoperability of applications and integration of large scale distributed systems. To make Web services accessible to users, service providers use Web service registries to publish them. Current infrastruc ..."
Abstract
-
Cited by 83 (6 self)
- Add to MetaCart
present a scalable, high performance environment for federated Web service publication and discovery among multiple registries. This work uses an ontology-based approach to organize registries, enabling semantic classification of all Web services based on domains. Each of these registries supports
Service discovery from observed behavior while guaranteeing deadlock freedom in collaborations. Asynchronous Communication 37
- In Samik Basu, Cesare Pautasso, Liang Zhang, and Xiang Fu, editors, Service-Oriented Computing, volume 8274 of Lecture Notes in Computer Science
, 2013
"... Abstract. Process discovery techniques can be used to derive a process model from observed example behavior (i.e., an event log). As the ob-served behavior is inherently incomplete and models may serve different purposes, four competing quality dimensions—fitness, precision, simplic-ity, and general ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
quality dimensions based on user preferences. Moreover, unlike existing discovery approaches, we guarantees that the composition of S and P is deadlock free. The service discovery technique has been imple-mented in ProM and experiments using service models of industrial size demonstrate the scalability
Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
- In Proceedings of ICDM’03
, 2003
"... In this paper we study the problem of classifying chemical compound datasets. We present a sub-structure-based classification algorithm that decouples the sub-structure discovery process from the classification model construction and uses frequent subgraph discovery algorithms to find all topologi ..."
Abstract
-
Cited by 140 (6 self)
- Add to MetaCart
In this paper we study the problem of classifying chemical compound datasets. We present a sub-structure-based classification algorithm that decouples the sub-structure discovery process from the classification model construction and uses frequent subgraph discovery algorithms to find all
Workflow management with service quality guarantees
- In Proceedings of the ACM SIGMOD International Conference on Management of Data
, 2002
"... Workflow management systems (WFMS) that are geared for the orchestration of business processes across multiple organizations are complex distributed systems: they consist of multiple workflow engines, application servers, and communication middleware servers such as ORBs, where each of these server ..."
Abstract
-
Cited by 40 (1 self)
- Add to MetaCart
types can be replicated on multiple computers for scalability and availability. Finding an appropriate system configuration with guaranteed application-specific quality of service in terms of throughput, response time, and tolerable downtime is a major challenge for human system administrators
Results 1 - 10
of
1,018
