Results 1 - 10 of 8,835

Least angle regression

by Bradley Efron, Trevor Hastie, Iain Johnstone, Robert Tibshirani , 2004
"... The purpose of model selection algorithms such as All Subsets, Forward Selection and Backward Elimination is to choose a linear model on the basis of the same set of data to which the model will be applied. Typically we have available a large collection of possible covariates from which we hope to s ..."
Abstract - Cited by 1326 (37 self) - Add to MetaCart
modification efficiently implements Forward Stagewise linear regression, another promising new model selection method; this connection explains the similar numerical results previously observed for the Lasso and Stagewise, and helps us understand the properties of both methods, which are seen as constrained

Incognito: efficient full-domain k-anonymity

by Kristen Lefevre, David J. Dewitt, Raghu Ramakrishnan - In Proc. of SIGMOD
"... A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes that clearly identify individuals, such as Name and Social Security Number, are generally removed, these databases can sometimes be joined with other public databases on attri ..."
Abstract - Cited by 304 (5 self) - Add to MetaCart
full-domain generalizations, and show that these algorithms perform up to an order of magnitude faster than previous algorithms on two real-life databases. Besides full-domain generalization, numerous other mod-els have also been proposed for k-anonymization. The sec-ond contribution in this paper is a

Refining Initial Points for K-Means Clustering

by P. S. Bradley, Usama M. Fayyad , 1998
"... Practical approaches to clustering use an iterative procedure (e.g. K-Means, EM) which converges to one of numerous local minima. It is known that these iterative techniques are especially sensitive to initial starting conditions. We present a procedure for computing a refined starting condition fro ..."
Abstract - Cited by 317 (5 self) - Add to MetaCart
Practical approaches to clustering use an iterative procedure (e.g. K-Means, EM) which converges to one of numerous local minima. It is known that these iterative techniques are especially sensitive to initial starting conditions. We present a procedure for computing a refined starting condition

Sun database: Largescale scene recognition from abbey to zoo

by Jianxiong Xiao, James Hays, Krista A. Ehinger, Aude Oliva, Antonio Torralba - In CVPR
"... Scene categorization is a fundamental problem in com-puter vision. However, scene understanding research has been constrained by the limited scope of currently-used databases which do not capture the full variety of scene categories. Whereas standard databases for object cate-gorization contain hund ..."
Abstract - Cited by 306 (37 self) - Add to MetaCart
Scene categorization is a fundamental problem in com-puter vision. However, scene understanding research has been constrained by the limited scope of currently-used databases which do not capture the full variety of scene categories. Whereas standard databases for object cate-gorization contain

A finite-volume, incompressible Navier–Stokes model for studies of the ocean on parallel computers.

by John Marshall , Alistair Adcroft , Chris Hill , Lev Perelman , Curt Heisey - J. Geophys. Res., , 1997
"... Abstract. The numerical implementation of an ocean model based on the incompressible Navier Stokes equations which is designed for studies of the ocean circulation on horizontal scales less than the depth of the ocean right up to global scale is described. A "pressure correction" method i ..."
Abstract - Cited by 293 (32 self) - Add to MetaCart
employed; it does not imply a particular constitutive relation. The relevant equations for modeling the full complexity of the ocean include, as here, active tracers such as temperature and salt.) It builds on ideas developed in the computational fluid community. The numerical challenge is to ensure

Image information and visual quality

by Hamid Rahim Sheikh, Alan C. Bovik - IEEE Trans. IP , 2006
"... Abstract—Measurement of visual quality is of fundamental importance to numerous image and video processing applica-tions. The goal of quality assessment (QA) research is to design algorithms that can automatically assess the quality of images or videos in a perceptually consistent manner. Image QA a ..."
Abstract - Cited by 283 (41 self) - Add to MetaCart
Abstract—Measurement of visual quality is of fundamental importance to numerous image and video processing applica-tions. The goal of quality assessment (QA) research is to design algorithms that can automatically assess the quality of images or videos in a perceptually consistent manner. Image QA

COPASI -- a COmplex PAthway SImulator

by Stefan Hoops, Sven Sahle, Ralph Gauges, Christine Lee, Jürgen Pahle, Natalia Simus, Mudita Singhal, Liang Xu, Pedro Mendes, Ursula Kummer - BIOINFORMATICS , 2006
"... Motivation: Simulation and modeling is becoming a standard approach to understand complex biochemical processes. Therefore, there is a big need for software tools that allow access to diverse simulation and modeling methods as well as support for the usage of these methods. Results: Here, we present ..."
Abstract - Cited by 270 (6 self) - Add to MetaCart
, and the importance of random number generator numerical resolution in stochastic simulation. Availability: The complete software is available in binary (executable) for MS Windows, OS X, Linux (Intel), and Sun Solaris (SPARC), as well as the full source code under an open source license from

One-Dimensional Dynamics

by Welington de Melo , Sebastian van Strien
"... One-dimensional dynamics has developed in the last decades into a subject in its own right. Yet, many recent results are inaccessible and have never been brought together. For this reason, we have tried to give a unified account of the subject and complete proofs of many results. To show what result ..."
Abstract - Cited by 267 (10 self) - Add to MetaCart
diffeomorphisms due to M. Herman, J.-C. Yoccoz and others. Chapter II treats the kneading theory of Milnor and Thurston; also included are an exposition on Hofbauer’s tower construction and a result on full

The Potential for Using Thread-Level Data Speculation to Facilitate Automatic Parallelization

by J. Gregory Steffan , Todd C. Mowry - HPCA-4 , 1998
"... As we look to the future, and the prospect of a billion transistors on a chip, it seems inevitable that microprocessors will exploit having multiple parallel threads. To achieve the full potential of these "single-chip multiprocessors," however, we must find a way to parallelize non-numeri ..."
Abstract - Cited by 256 (9 self) - Add to MetaCart
As we look to the future, and the prospect of a billion transistors on a chip, it seems inevitable that microprocessors will exploit having multiple parallel threads. To achieve the full potential of these "single-chip multiprocessors," however, we must find a way to parallelize non-numeric

NUMERICAL SIMULATION OF STRUCTURAL BEHAVIOUR OF TRANSMISSION TOWERS

by Fga Albermani, S Kitipornchai
"... Transmission towers are a vital component and management needs to assess the reliability and safety of these towers to minimise the risk of disruption to power supply that may result from in-service tower failure. Latticed transmission towers are constructed using angle section members which are ecc ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
are eccentrically connected. Towers are widely regarded as one of the most difficult form of lattice structure to analyse. Factors such as fabrication errors, inadequate joint details and variation of material properties are difficult to quantify. Consequently, proof-loading or full-scale testing of towers has
Results 1 - 10 of 8,835