Results 1 - 10 of 20,262

Tandem repeats finder: a program to analyze DNA sequences

by Gary Benson , 1999
"... A tandem repeat in DNA is two or more contiguous, approximate copies of a pattern of nucleotides. Tandem repeats have been shown to cause human disease, may play a variety of regulatory and evolutionary roles and are important laboratory and analytic tools. Extensive knowledge about pattern size, co ..."
Abstract - Cited by 961 (9 self) - Add to MetaCart
A tandem repeat in DNA is two or more contiguous, approximate copies of a pattern of nucleotides. Tandem repeats have been shown to cause human disease, may play a variety of regulatory and evolutionary roles and are important laboratory and analytic tools. Extensive knowledge about pattern size

Wide-area Internet traffic patterns and characteristics

by Kevin Thompson, Gregory J. Miller, Rick Wilder - IEEE NETWORK , 1997
"... The Internet is rapidly growing in number of users, traffic levels, and topological complexity. At the same time it is increasingly driven by economic competition. These developments render the characterization of network usage and workloads more difficult, and yet more critical. Few recent studies ..."
Abstract - Cited by 518 (0 self) - Add to MetaCart
) in the presence of up to 240,000 flows. We reveal the characteristics of the traffic in terms of packet sizes, flow duration, volume, and percentage composition by protocol and application, as well as patterns seen over the two time scales.

Mining Sequential Patterns: Generalizations and Performance Improvements

by Ramakrishnan Srikant, Rakesh Agrawal - RESEARCH REPORT RJ 9994, IBM ALMADEN RESEARCH , 1995
"... The problem of mining sequential patterns was recently introduced in [3]. We are given a database of sequences, where each sequence is a list of transactions ordered by transaction-time, and each transaction is a set of items. The problem is to discover all sequential patterns with a user-specified ..."
Abstract - Cited by 759 (5 self) - Add to MetaCart
these generalized sequential patterns. Empirical evaluation using synthetic and real-life data indicates that GSP is much faster than the AprioriAll algorithm presented in [3]. GSP scales linearly with the number of data-sequences, and has very good scale-up properties with respect to the average data-sequence size.

Data Preparation for Mining World Wide Web Browsing Patterns

by Robert Cooley, Bamshad Mobasher, Jaideep Srivastava - KNOWLEDGE AND INFORMATION SYSTEMS , 1999
"... The World Wide Web (WWW) continues to grow at an astounding rate in both the sheer volume of tra#c and the size and complexity of Web sites. The complexity of tasks such as Web site design, Web server design, and of simply navigating through a Web site have increased along with this growth. An i ..."
Abstract - Cited by 567 (43 self) - Add to MetaCart
The World Wide Web (WWW) continues to grow at an astounding rate in both the sheer volume of tra#c and the size and complexity of Web sites. The complexity of tasks such as Web site design, Web server design, and of simply navigating through a Web site have increased along with this growth

Efficiently mining long patterns from databases

by Roberto J. Bayardo , 1998
"... We present a pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In comparison, previous algorithms based on Apriori scale exponentially with longest pattern length. Experiments on real data ..."
Abstract - Cited by 457 (3 self) - Add to MetaCart
on some data-sets. On other data-sets where the patterns are not so long, the gains are more modest. In practice, Max-Miner is demonstrated to run in time that is roughly linear in the number of maximal frequent itemsets and the size of the database, irrespective of the size of the longest frequent

Recognizing human actions: A local SVM approach

by Christian Schüldt, Ivan Laptev, Barbara Caputo - In ICPR , 2004
"... Local space-time features capture local events in video and can be adapted to the size, the frequency and the velocity of moving patterns. In this paper we demonstrate how such features can be used for recognizing complex motion patterns. We construct video representations in terms of local space-ti ..."
Abstract - Cited by 758 (20 self) - Add to MetaCart
Local space-time features capture local events in video and can be adapted to the size, the frequency and the velocity of moving patterns. In this paper we demonstrate how such features can be used for recognizing complex motion patterns. We construct video representations in terms of local space

Capacity of Ad Hoc Wireless Networks

by Jinyang Li, Charles Blake, Douglas S. J. De Couto, Hu Imm Lee, Robert Morris
"... Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others’ packets. The achievable capacity depends on network size, traffic patterns, and detailed local radio interactions. This paper examine ..."
Abstract - Cited by 636 (14 self) - Add to MetaCart
Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others’ packets. The achievable capacity depends on network size, traffic patterns, and detailed local radio interactions. This paper

Geographic Concentration in U.S. Manufacturing Industries: A Dartboard Approach

by Glenn Ellison, Edward L. Glaeser - Journal of Political Economy
"... This paper discusses the prevalence of Silicon Valley–style localiza-tions of individual manufacturing industries in the United States. A model in which localized industry-specific spillovers, natural ad-vantages, and pure random chance all contribute to geographic concentration is used to develop a ..."
Abstract - Cited by 599 (16 self) - Add to MetaCart
a test for whether observed levels of concentration are greater than would be expected to arise ran-domly and to motivate new indices of geographic concentration and of coagglomeration. The proposed indices control for differ-ences in the size distribution of plants and for differences in the size

Random Early Detection Gateways for Congestion Avoidance.

by Sally Floyd , Van Jacobson - IEEELACM Transactions on Networking, , 1993
"... Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract - Cited by 2716 (31 self) - Add to MetaCart
Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving

Combining Branch Predictors

by Scott Mcfarling , 1993
"... One of the key factors determining computer performance is the degree to which the implementation can take advantage of instruction-level paral-lelism. Perhaps the most critical limit to this parallelism is the presence of conditional branches that determine which instructions need to be executed ne ..."
Abstract - Cited by 629 (0 self) - Add to MetaCart
next. To increase parallelism, several authors have suggested ways of predicting the direction of conditional branches with hardware that uses the history of previous branches. The different proposed predictors take advan-tage of different observed patterns in branch behavior. This paper presents a
Results 1 - 10 of 20,262