Results 1  10
of
7,492
Fronts propagating with curvature dependent speed: algorithms based on Hamilton–Jacobi formulations
, 1988
"... We devise new numerical algorithms, called PSC algorithms, for following fronts propagating with curvaturedependent speed. The speed may be an arbitrary function of curvature, and the front also can be passively advected by an underlying flow. These algorithms approximate the equations of motion, w ..."
Abstract

Cited by 1183 (60 self)
 Add to MetaCart
We devise new numerical algorithms, called PSC algorithms, for following fronts propagating with curvaturedependent speed. The speed may be an arbitrary function of curvature, and the front also can be passively advected by an underlying flow. These algorithms approximate the equations of motion
On the Selfsimilar Nature of Ethernet Traffic (Extended Version)
, 1994
"... We demonstrate that Ethernet LAN traffic is statistically selfsimilar, that none of the commonly used traffic models is able to capture this fractallike behavior, that such behavior has serious implications for the design, control, and analysis of highspeed, cellbased networks, and that aggrega ..."
Abstract

Cited by 2213 (46 self)
 Add to MetaCart
We demonstrate that Ethernet LAN traffic is statistically selfsimilar, that none of the commonly used traffic models is able to capture this fractallike behavior, that such behavior has serious implications for the design, control, and analysis of highspeed, cellbased networks
Inductive learning algorithms and representations for text categorization,”
 in Proceedings of the International Conference on Information and Knowledge Management,
, 1998
"... ABSTRACT Text categorization the assignment of natural language texts to one or more predefined categories based on their content is an important component in many information organization and management tasks. We compare the effectiveness of five different automatic learning algorithms for text ..."
Abstract

Cited by 652 (8 self)
 Add to MetaCart
ABSTRACT Text categorization the assignment of natural language texts to one or more predefined categories based on their content is an important component in many information organization and management tasks. We compare the effectiveness of five different automatic learning algorithms for text
A scheduling model for reduced CPU energy
 ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1995
"... The energy usage of computer systems is becoming an important consideration, especially for batteryoperated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job s ..."
Abstract

Cited by 558 (3 self)
 Add to MetaCart
scheduling aimed at capturing some key aspects of energy minimization. In this model, each job is to be executed between its arrival time and deadline by a single processor with variable speed, under the assumption that energy usage per unit time, P, is a convex function of the processor speed s. We give
Globus: A Metacomputing Infrastructure Toolkit
 International Journal of Supercomputer Applications
, 1996
"... Emerging highperformance applications require the ability to exploit diverse, geographically distributed resources. These applications use highspeed networks to integrate supercomputers, large databases, archival storage devices, advanced visualization devices, and/or scientific instruments to for ..."
Abstract

Cited by 1929 (51 self)
 Add to MetaCart
Emerging highperformance applications require the ability to exploit diverse, geographically distributed resources. These applications use highspeed networks to integrate supercomputers, large databases, archival storage devices, advanced visualization devices, and/or scientific instruments
A Fast Marching Level Set Method for Monotonically Advancing Fronts
 PROC. NAT. ACAD. SCI
, 1995
"... We present a fast marching level set method for monotonically advancing fronts, which leads to an extremely fast scheme for solving the Eikonal equation. Level set methods are numerical techniques for computing the position of propagating fronts. They rely on an initial value partial differential eq ..."
Abstract

Cited by 630 (24 self)
 Add to MetaCart
equation for a propagating level set function, and use techniques borrowed from hyperbolic conservation laws. Topological changes, corner and cusp development, and accurate determination of geometric properties such as curvature and normal direction are naturally obtained in this setting. In this paper, we
Online learning for matrix factorization and sparse coding
, 2010
"... Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statistics. This paper focuses on the largescale matrix factorization problem that consists of learning the basis set in order to ad ..."
Abstract

Cited by 330 (31 self)
 Add to MetaCart
, which scales up gracefully to large data sets with millions of training samples, and extends naturally to various matrix factorization formulations, making it suitable for a wide range of learning problems. A proof of convergence is presented, along with experiments with natural images and genomic data
Levelwise Search and Borders of Theories in Knowledge Discovery
, 1997
"... One of the basic problems in knowledge discovery in databases (KDD) is the following: given a data set r, a class L of sentences for defining subgroups of r, and a selection predicate, find all sentences of L deemed interesting by the selection predicate. We analyze the simple levelwise algorithm fo ..."
Abstract

Cited by 263 (15 self)
 Add to MetaCart
process: given r and a set of sentences S ` L, determine whether S is exactly the set of interesting statements about r. We show strong connections between the verification problem and the hypergraph transversal problem. The verification problem arises in a natural way when using sampling to speed up
Recurrence Times And Rates Of Mixing
, 1997
"... The setting of this paper consists of a map making "nice" returns to a reference set. Criteria for the existence of equilibria, speed of convergence to equilibria and for the central limit theorem are given in terms of the tail of the return time function. The abstract setting considered a ..."
Abstract

Cited by 238 (10 self)
 Add to MetaCart
arises naturally in differentiable dynamical systems with some expanding or hyperbolic properties. This paper is part of an attempt to understand the speed of mixing and related statistical properties for chaotic dynamical systems. More precisely, we are interested in systems that are expanding
Results 1  10
of
7,492