Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
110
Collection Tree Protocol
"... This paper presents and evaluates two principles for designing robust, reliable, and efficient collection protocols. These principles allow a protocol to benefit from accurate and agile link estimators by handling the dynamism such estimators introduce to routing tables. The first is datapath valida ..."
Abstract
- Add to MetaCart
latency. We study these mechanisms in an implementation called Collection Tree Protocol (CTP) and evaluate their contributions to its performance. We evaluate CTP on 12 different testbeds ranging in size from 20–310 nodes and comprising 7 hardware platforms, on 6 different link layers, and on interference
A dynamic adaptation of AD-trees for efficient machine learning on large data sets
- In Proceedings of the 17th International Conference on Machine Learning
, 2000
"... This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced with data sets with massive numbers of records or attributes. It briefly reviews the static AD-tree structure of Moore and L ..."
Abstract
-
Cited by 21 (5 self)
- Add to MetaCart
in cases where new data is frequently being appended to the data set. We provide a careful explanation of the data structure, and then empirically evaluate the performance under varying access patterns induced by different learning algorithms such as association rules, decision trees and Bayes net
doi:10.1093/comjnl/bxp026 A Digest and Pattern Matching-Based Intrusion Detection Engine
, 2008
"... Intrusion detection/prevention systems (IDSs/IPSs) heavily rely on signature databases and pattern matching (PM) techniques to identify network attacks. The engines of such systems often employ traditional PM algorithms to search for telltale patterns in network flows. The observations that real-wor ..."
Abstract
- Add to MetaCart
Intrusion detection/prevention systems (IDSs/IPSs) heavily rely on signature databases and pattern matching (PM) techniques to identify network attacks. The engines of such systems often employ traditional PM algorithms to search for telltale patterns in network flows. The observations that real
The central question in entrepreneurial cognition research 2007. Entrepreneurship Theory and Practice,
, 2007
"... In this article, we take note of advances in the entrepreneurial cognition research stream. In doing so, we bring increasing attention to the usefulness of entrepreneurial cognition research. First, we offer and develop a central research question to further enable entrepreneurial cognition inquiry ..."
Abstract
-
Cited by 42 (4 self)
- Add to MetaCart
aspects of a simple four-word query: "How do entrepreneurs think?" Whether or not researchers are probing individual differences and why some people make better entrepreneurs than others, studying how 2 ENTREPRENEURSHIP THEORY and PRACTICE entrepreneurs develop unique knowledge structures
1A WEIGHTED-TREE SIMILARITY ALGORITHM FOR MULTI-AGENT SYSTEMS IN E-BUSINESS ENVIRONMENTS*
"... A tree similarity algorithm for match-making of agents in e-Business environments is presented. Product/service descriptions of seller and buyer agents are represented as node-labelled, arc-labelled, arc-weighted trees. A similarity algorithm for such trees is developed as the basis for semantic mat ..."
Abstract
- Add to MetaCart
A tree similarity algorithm for match-making of agents in e-Business environments is presented. Product/service descriptions of seller and buyer agents are represented as node-labelled, arc-labelled, arc-weighted trees. A similarity algorithm for such trees is developed as the basis for semantic
Query Evaluation with Constant Delay
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract
- Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available
New Techniques for Geographic Routing
, 2006
"... As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing, but ..."
Abstract
- Add to MetaCart
As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing, but deployments of such algorithms are currently uncommon because of some practical difficulties.
Annual variability in seed production by woody plants and the masting concept: Reassessment of principles and relationship to pollination and seed dispersal. The American Naturalist 152
, 1998
"... ABSTRACT: By analyzing 296 published and unpublished data sets describing annual variation in seed output by 144 species of woody plants, this article addresses the following questions. Do plant species naturally fall into distinct groups corresponding to masting and nonmasting habits? Do plant pop ..."
Abstract
-
Cited by 28 (0 self)
- Add to MetaCart
," and have dealt with species putatively exhibiting this seeding pattern (see Questions and Predictions By analyzing a large sample of published and unpublished data on annual seed production by a taxonomically and ecologically diverse array of polycarpic woody plants, we will specifically address
Results 1 - 10
of
110
