Results 1 - 10 of 3,895

Scaling Step-Wise Refinement

by Don Batory, Jacob Neal Sarvela, Axel Rauschmayer - IEEE TRANSACTIONS ON SOFTWARE ENGINEERING , 2004
"... Step-wise refinement is a powerful paradigm for developing a complex program from a simple program by adding features incrementally. We present the AHEAD (Algebraic Hierarchical Equations for Application Design) model that shows how step-wise refinement scales to synthesize multiple programs and mu ..."
Abstract - Cited by 454 (41 self) - Add to MetaCart
Step-wise refinement is a powerful paradigm for developing a complex program from a simple program by adding features incrementally. We present the AHEAD (Algebraic Hierarchical Equations for Application Design) model that shows how step-wise refinement scales to synthesize multiple programs

Step-wise Refinement Design Example Using LOTOS

by Lus Ferreira Pires, Grande (pb) Brazil , 1991
"... The importance of a design methodology when using Formal Description Techniques is generally agreed in the scientific community. This paper presents some design principles and concepts that characterize a step-wise refinement design approach and illustrates their application on an example of a mutua ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
The importance of a design methodology when using Formal Description Techniques is generally agreed in the scientific community. This paper presents some design principles and concepts that characterize a step-wise refinement design approach and illustrates their application on an example of a

QSplat: A Multiresolution Point Rendering System for Large Meshes

by Szymon Rusinkiewicz, Marc Levoy , 2000
"... Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing and p ..."
Abstract - Cited by 502 (8 self) - Add to MetaCart
be computed quickly, making it suitable for large data sets. Our implementation, written for use in a large-scale 3D digitization project, launches quickly, maintains a user-settable interactive frame rate regardless of object complexity or camera position, yields reasonable image quality during motion

Scaling Personalized Web Search

by Glen Jeh, Jennifer Widom - In Proceedings of the Twelfth International World Wide Web Conference , 2002
"... Recent web search techniques augment traditional text matching with a global notion of "importance" based on the linkage structure of the web, such as in Google's PageRank algorithm. For more refined searches, this global notion of importance can be specialized to create personalized ..."
Abstract - Cited by 409 (2 self) - Add to MetaCart
Recent web search techniques augment traditional text matching with a global notion of "importance" based on the linkage structure of the web, such as in Google's PageRank algorithm. For more refined searches, this global notion of importance can be specialized to create personalized

Automatically validating temporal safety properties of interfaces

by Thomas Ball, Sriram K. Rajamani , 2001
"... We present a process for validating temporal safety properties of software that uses a well-defined interface. The process requires only that the user state the property of interest. It then automatically creates abstractions of C code using iterative refinement, based on the given property. The pro ..."
Abstract - Cited by 433 (21 self) - Add to MetaCart
We present a process for validating temporal safety properties of software that uses a well-defined interface. The process requires only that the user state the property of interest. It then automatically creates abstractions of C code using iterative refinement, based on the given property

X-means: Extending K-means with Efficient Estimation of the Number of Clusters

by Dau Pelleg, Andrew Moore - In Proceedings of the 17th International Conf. on Machine Learning , 2000
"... Despite its popularity for general clustering, K-means suffers three major shortcomings; it scales poorly computationally, the number of clusters K has to be supplied by the user, and the search is prone to local minima. We propose solutions for the first two problems, and a partial remedy for the t ..."
Abstract - Cited by 418 (5 self) - Add to MetaCart
Despite its popularity for general clustering, K-means suffers three major shortcomings; it scales poorly computationally, the number of clusters K has to be supplied by the user, and the search is prone to local minima. We propose solutions for the first two problems, and a partial remedy

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

Hamming embedding and weak geometric consistency for large scale image search

by Herve Jegou, Matthijs Douze, Cordelia Schmid - In ECCV , 2008
"... Abstract. This paper improves recent methods for large scale image search. State-of-the-art methods build on the bag-of-features image representation. We, first, analyze bag-of-features in the framework of approximate nearest neighbor search. This shows the suboptimality of such a representation for ..."
Abstract - Cited by 330 (35 self) - Add to MetaCart
Abstract. This paper improves recent methods for large scale image search. State-of-the-art methods build on the bag-of-features image representation. We, first, analyze bag-of-features in the framework of approximate nearest neighbor search. This shows the suboptimality of such a representation

Multilevel hypergraph partitioning: Application in VLSI domain

by George Karypis, Rajat Aggarwal, Vipin Kumar, Shashi Shekhar - IEEE TRANS. VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS , 1999
"... In this paper, we present a new hypergraphpartitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergraphs is constructed. A bisection of the smallest hypergraph is computed and it is used to obtain a bisection of the origina ..."
Abstract - Cited by 315 (22 self) - Add to MetaCart
of the original hypergraph by successively projecting and refining the bisection to the next level finer hypergraph. We have developed new hypergraph coarsening strategies within the multilevel framework. We evaluate their performance both in terms of the size of the hyperedge cut on the bisection, as well

The Fagerstrom Test for Nicotine Dependence: a revision of the Fagerstrom Tolerance Questionnaire

by Todd F. Heatherton, Lynn T. Kozlowski, Richard C. Frecker, Karl-olov Fagerstrom - Br. J. Addict , 1991
"... We examine and refine the Pagerstrom Tolerance Questionnaire (PTQ Pagerstrom, 1978). The relation between each PTQ item and biochemical measures of heaviness of smoking was examined in 254 smokers. We found that the nicotine rating item and the inhalation item were unrelated to any of our biochemica ..."
Abstract - Cited by 308 (1 self) - Add to MetaCart
We examine and refine the Pagerstrom Tolerance Questionnaire (PTQ Pagerstrom, 1978). The relation between each PTQ item and biochemical measures of heaviness of smoking was examined in 254 smokers. We found that the nicotine rating item and the inhalation item were unrelated to any of our
Results 1 - 10 of 3,895