Results 1  10
of
1,709,208
ScaleSpace Theory in Computer Vision
, 1994
"... A basic problem when deriving information from measured data, such as images, originates from the fact that objects in the world, and hence image structures, exist as meaningful entities only over certain ranges of scale. "ScaleSpace Theory in Computer Vision" describes a formal theory fo ..."
Abstract

Cited by 617 (21 self)
 Add to MetaCart
A basic problem when deriving information from measured data, such as images, originates from the fact that objects in the world, and hence image structures, exist as meaningful entities only over certain ranges of scale. "ScaleSpace Theory in Computer Vision" describes a formal theory
The space complexity of approximating the frequency moments
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 1996
"... The frequency moments of a sequence containing mi elements of type i, for 1 ≤ i ≤ n, are the numbers Fk = �n i=1 mki. We consider the space complexity of randomized algorithms that approximate the numbers Fk, when the elements of the sequence are given one by one and cannot be stored. Surprisingly, ..."
Abstract

Cited by 855 (12 self)
 Add to MetaCart
The frequency moments of a sequence containing mi elements of type i, for 1 ≤ i ≤ n, are the numbers Fk = �n i=1 mki. We consider the space complexity of randomized algorithms that approximate the numbers Fk, when the elements of the sequence are given one by one and cannot be stored. Surprisingly
A Practical Guide to Wavelet Analysis
, 1998
"... A practical stepbystep guide to wavelet analysis is given, with examples taken from time series of the El Nio Southern Oscillation (ENSO). The guide includes a comparison to the windowed Fourier transform, the choice of an appropriate wavelet basis function, edge effects due to finitelength t ..."
Abstract

Cited by 833 (3 self)
 Add to MetaCart
A practical stepbystep guide to wavelet analysis is given, with examples taken from time series of the El Nio Southern Oscillation (ENSO). The guide includes a comparison to the windowed Fourier transform, the choice of an appropriate wavelet basis function, edge effects due to finite
BDI Agents: From Theory to Practice
 IN PROCEEDINGS OF THE FIRST INTERNATIONAL CONFERENCE ON MULTIAGENT SYSTEMS (ICMAS95
, 1995
"... The study of computational agents capable of rational behaviour has received a great deal of attention in recent years. Theoretical formalizations of such agents and their implementations have proceeded in parallel with little or no connection between them. This paper explores a particular typ ..."
Abstract

Cited by 880 (3 self)
 Add to MetaCart
an ideal theoretical perspective and a more practical perspective; and (c) the building of largescale applications based on BDI agents. In particular, an airtraffic management application will be described from both a theoretical and an implementation perspective.
Practical network support for IP traceback
, 2000
"... This paper describes a technique for tracing anonymous packet flooding attacks in the Internet back towards their source. This work is motivated by the increased frequency and sophistication of denialofservice attacks and by the difficulty in tracing packets with incorrect, or “spoofed”, source ad ..."
Abstract

Cited by 666 (14 self)
 Add to MetaCart
This paper describes a technique for tracing anonymous packet flooding attacks in the Internet back towards their source. This work is motivated by the increased frequency and sophistication of denialofservice attacks and by the difficulty in tracing packets with incorrect, or “spoofed”, source addresses. In this paper we describe a general purpose traceback mechanism based on probabilistic packet marking in the network. Our approach allows a victim to identify the network path(s) traversed by attack traffic without requiring interactive operational support from Internet Service Providers (ISPs). Moreover, this traceback can be performed “postmortem ” – after an attack has completed. We present an implementation of this technology that is incrementally deployable, (mostly) backwards compatible and can be efficiently implemented using conventional technology. 1.
Distributed Computing in Practice: The Condor Experience
 Concurrency and Computation: Practice and Experience
, 2005
"... Since 1984, the Condor project has enabled ordinary users to do extraordinary computing. Today, the project continues to explore the social and technical problems of cooperative computing on scales ranging from the desktop to the worldwide computational grid. In this chapter, we provide the history ..."
Abstract

Cited by 542 (7 self)
 Add to MetaCart
Since 1984, the Condor project has enabled ordinary users to do extraordinary computing. Today, the project continues to explore the social and technical problems of cooperative computing on scales ranging from the desktop to the worldwide computational grid. In this chapter, we provide the history and philosophy of the Condor project and describe how it has interacted with other projects and evolved along with the field of distributed computing. We outline the core components of the Condor system and describe how the technology of computing must correspond to social structures. Throughout, we reflect on the lessons of experience and chart the course traveled by research ideas as they grow into production systems.
Surface deformation due to shear and tensile faults in a halfspace
, 1985
"... A complete set of closed analytical expressions is presented in a unified manner for the internal displacements and strains due to shear and tensile faults in a halfspace for both point and finite rectangular sources. These expressions are particularly compact and systematically composed of terms r ..."
Abstract

Cited by 698 (1 self)
 Add to MetaCart
A complete set of closed analytical expressions is presented in a unified manner for the internal displacements and strains due to shear and tensile faults in a halfspace for both point and finite rectangular sources. These expressions are particularly compact and systematically composed of terms
JFlow: Practical MostlyStatic Information Flow Control
 In Proc. 26th ACM Symp. on Principles of Programming Languages (POPL
, 1999
"... A promising technique for protecting privacy and integrity of sensitive data is to statically check information flow within programs that manipulate the data. While previous work has proposed programming language extensions to allow this static checking, the resulting languages are too restrictive f ..."
Abstract

Cited by 579 (32 self)
 Add to MetaCart
for practical use and have not been implemented. In this paper, we describe the new language JFlow, an extension to the Java language that adds staticallychecked information flow annotations. JFlow provides several new features that make information flow checking more flexible and convenient than in previous
A practical guide to support vector classification
, 2010
"... The support vector machine (SVM) is a popular classification technique. However, beginners who are not familiar with SVM often get unsatisfactory results since they miss some easy but significant steps. In this guide, we propose a simple procedure which usually gives reasonable results. ..."
Abstract

Cited by 787 (7 self)
 Add to MetaCart
The support vector machine (SVM) is a popular classification technique. However, beginners who are not familiar with SVM often get unsatisfactory results since they miss some easy but significant steps. In this guide, we propose a simple procedure which usually gives reasonable results.
Results 1  10
of
1,709,208