Results 1  10
of
9,854
ATOMIC DECOMPOSITION BY BASIS PURSUIT
, 1995
"... The TimeFrequency and TimeScale communities have recently developed a large number of overcomplete waveform dictionaries  stationary wavelets, wavelet packets, cosine packets, chirplets, and warplets, to name a few. Decomposition into overcomplete systems is not unique, and several methods for d ..."
Abstract

Cited by 2728 (61 self)
 Add to MetaCart
variation denoising, and multiscale edge denoising. Basis Pursuit in highly overcomplete dictionaries leads to largescale optimization problems. With signals of length 8192 and a wavelet packet dictionary, one gets an equivalent linear program of size 8192 by 212,992. Such problems can be attacked
PolynomialTime Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
 SIAM J. on Computing
, 1997
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 1277 (4 self)
 Add to MetaCart
. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and which have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical
Algorithms for Quantum Computation: Discrete Logarithms and Factoring
, 1994
"... A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in computation time of at most a polynomial factol: It is not clear whether this is still true when quantum mechanics is taken into consider ..."
Abstract

Cited by 1111 (5 self)
 Add to MetaCart
of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored. These two problems are generally considered hard on a classical computer and have been used as the basis of several proposed cryptosystems. (We thus give the first examples of quantum cryptanulysis.)
OPTICS: Ordering Points To Identify the Clustering Structure
, 1999
"... Cluster analysis is a primary method for database mining. It is either used as a standalone tool to get insight into the distribution of a data set, e.g. to focus further analysis and data processing, or as a preprocessing step for other algorithms operating on the detected clusters. Almost all of ..."
Abstract

Cited by 527 (51 self)
 Add to MetaCart
ordering contains information which is equivalent to the densitybased clusterings corresponding to a broad range of parameter settings. It is a versatile basis for both automatic and interactive cluster analysis. We show how to automatically and efficiently extract not only ‘traditional ’ clustering information (e
Threedimensional object recognition from single twodimensional images
 Artificial Intelligence
, 1987
"... A computer vision system has been implemented that can recognize threedimensional objects from unknown viewpoints in single grayscale images. Unlike most other approaches, the recognition is accomplished without any attempt to reconstruct depth information bottomup from the visual input. Instead, ..."
Abstract

Cited by 484 (7 self)
 Add to MetaCart
, a probabilistic ranking method is used to reduce the size of the search space during model based matching. Finally, a process of spatial correspondence brings the projections of threedimensional models into direct correspondence with the image by solving for unknown viewpoint and model parameters
Nanotoxicology: an emerging discipline evolving from studies of ultrafine particles. Environ Health Perspect 113:823–839
, 2005
"... Although humans have been exposed to airborne nanosized particles (NSPs; < 100 nm) throughout their evolutionary stages, such exposure has increased dramatically over the last century due to anthropogenic sources. The rapidly developing field of nanotechnology is likely to become yet another sour ..."
Abstract

Cited by 448 (3 self)
 Add to MetaCart
as the basis for the expanding field of nanotoxicology, which can be defined as safety evaluation of engineered nanostructures and nanodevices. Collectively, some emerging concepts of nanotoxicology can be identified from the results of these studies. When inhaled, specific sizes of NSPs are efficiently
Competition in twosided markets
 The MITRE Corporation
, 1989
"... Many markets involve two groups of agents who interact via “platforms, ” where one group’s benefit from joining a platform depends on the size of the other group that joins the platform. I present three models of such markets: a monopoly platform; a model of competing platforms where agents join a s ..."
Abstract

Cited by 374 (2 self)
 Add to MetaCart
Many markets involve two groups of agents who interact via “platforms, ” where one group’s benefit from joining a platform depends on the size of the other group that joins the platform. I present three models of such markets: a monopoly platform; a model of competing platforms where agents join a
Poisson Surface Reconstruction
, 2006
"... We show that surface reconstruction from oriented points can be cast as a spatial Poisson problem. This Poisson formulation considers all the points at once, without resorting to heuristic spatial partitioning or blending, and is therefore highly resilient to data noise. Unlike radial basis function ..."
Abstract

Cited by 369 (5 self)
 Add to MetaCart
function schemes, our Poisson approach allows a hierarchy of locally supported basis functions, and therefore the solution reduces to a well conditioned sparse linear system. We describe a spatially adaptive multiscale algorithm whose time and space complexities are proportional to the size
The LRUK Page Replacement Algorithm For Database Disk Buffering
, 1993
"... This paper introduces a new approach to database disk buffering, called the LRUK method. The basic idea of LRUK is to keep track of the times of the last K references to popular database pages, using this information to statistically estimate the interarrival time of such references on a page by p ..."
Abstract

Cited by 330 (3 self)
 Add to MetaCart
by page basis. Although the LRUK approach performs optimal statistical inference under relatively standard assumptions, it is fairly simple and incurs little bookkeeping overhead. As we demonstrate with simulation experiments, the LRUK algorithm surpasses conventional buffering algorithms
Efficient Algorithms for Mining Outliers from Large Data Sets
, 2000
"... In this paper, we propose a novel formulation for distancebased outliers that is based on the distance of a point from its k th nearest neighbor. We rank each point on the basis of its distance to its k th nearest neighbor and declare the top n points in this ranking to be outliers. In addition ..."
Abstract

Cited by 322 (0 self)
 Add to MetaCart
In this paper, we propose a novel formulation for distancebased outliers that is based on the distance of a point from its k th nearest neighbor. We rank each point on the basis of its distance to its k th nearest neighbor and declare the top n points in this ranking to be outliers
Results 1  10
of
9,854