Results 1 - 10 of 3,567

Perspectives on Program Analysis

by Flemming Nielson , 1996
"... eing analysed. On the negative side, the semantic correctness of the analysis is seldom established and therefore there is often no formal justification for the program transformations for which the information is used. The semantics based approach [1; 5] is often based on domain theory in the form ..."
Abstract - Cited by 685 (35 self) - Add to MetaCart
eing analysed. On the negative side, the semantic correctness of the analysis is seldom established and therefore there is often no formal justification for the program transformations for which the information is used. The semantics based approach [1; 5] is often based on domain theory

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

by Farid Alizadeh - SIAM Journal on Optimization , 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract - Cited by 547 (12 self) - Add to MetaCart
to SDP. Next we present an interior point algorithm which converges to the optimal solution in polynomial time. The approach is a direct extension of Ye's projective method for linear programming. We also argue that most known interior point methods for linear programs can be transformed in a

GHT: A Geographic Hash Table for Data-Centric Storage

by Sylvia Ratnasamy, Brad Karp, Li Yin, Fang Yu, Deborah Estrin, Ramesh Govindan, Scott Shenker , 2002
"... Making effective use of the vast amounts of data gathered by largescale sensor networks will require scalable, self-organizing, and energy-efficient data dissemination algorithms. Previous work has identified data-centric routing as one such method. In an associated position paper [23], we argue tha ..."
Abstract - Cited by 392 (30 self) - Add to MetaCart
Making effective use of the vast amounts of data gathered by largescale sensor networks will require scalable, self-organizing, and energy-efficient data dissemination algorithms. Previous work has identified data-centric routing as one such method. In an associated position paper [23], we argue

A Trainable System for Object Detection

by Constantine Papageorgiou, Tomaso Poggio , 2000
"... This paper presents a general, trainable system for object detection in unconstrained, cluttered scenes. The system derives much of its power from a representation that describes an object class in terms of an overcomplete dictionary of local, oriented, multiscale intensity differences between adj ..."
Abstract - Cited by 344 (8 self) - Add to MetaCart
adjacent regions, efficiently computable as a Haar wavelet transform. This example-based learning approach implicitly derives a model of an object class by training a support vector machine classifier using a large set of positive and negative examples. We present results on face, people, and car detection

Reliable Feature Matching Across Widely Separated Views

by Adam Baumberg , 2000
"... In this paper we present a robust method for automatically matching features in images corresponding to the same physical point on an object seen from two arbitrary viewpoints. Unlike conventional stereo matching approaches we assume no prior knowledge about the relative camera positions and orienta ..."
Abstract - Cited by 308 (0 self) - Add to MetaCart
In this paper we present a robust method for automatically matching features in images corresponding to the same physical point on an object seen from two arbitrary viewpoints. Unlike conventional stereo matching approaches we assume no prior knowledge about the relative camera positions

Energy-efficient rate-adaptive gps-based positioning for smartphones

by Jeongyeup Paek, Joongheon Kim, Ramesh Govindan - In Proceedings of ACM MobiSys ’10
"... Many emerging smartphone applications require position information to provide location-based or context-aware services. In these applications, GPS is often preferred over its alternatives such as GSM/WiFi based positioning systems because it is known to be more accurate. However, GPS is extremely po ..."
Abstract - Cited by 91 (1 self) - Add to MetaCart
power hungry. Hence a common approach is to periodically duty-cycle GPS. However, GPSduty-cyclingtrades-offpositioningaccuracyforlowerenergy. A key requirement for such applications, then, is a positioning system that provides accurate position information while spending minimalenergy. In this paper, we

HAMMER: hierarchical attribute matching mechanism for elastic registration

by Dinggang Shen, Christos Davatzikos - IEEE Trans. on Medical Imaging , 2002
"... A new approach is presented for elastic registration of medical images, and is applied to magnetic resonance images of the brain. Experimental results demonstrate remarkably high accuracy in superposition of images from different subjects, thus enabling very precise localization of morphological cha ..."
Abstract - Cited by 278 (95 self) - Add to MetaCart
deformation mechanism, which is initially influenced by parts of the anatomy that can be identified relatively more reliably than others. Moreover, the deformation mechanism involves a sequence of local smooth transformations, which do not update positions of individual voxels, but rather are based

Classification using Intersection Kernel Support Vector Machines is Efficient ∗

by Subhransu Maji, Alexander C. Berg, Jitendra Malik
"... Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can do this much more efficiently. In particular we show that one can build histogram intersection kernel SVMs (IKSVMs) with ..."
Abstract - Cited by 256 (10 self) - Add to MetaCart
Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can do this much more efficiently. In particular we show that one can build histogram intersection kernel SVMs (IKSVMs

Millwork 101: Transforming the Market for Energy-Efficient Windows

by Philip E. Mihlmester, Icf Consulting, Michael Gibbs, Icf Consulting, William F. Grimm, Southern California Edison, James Stimmel, Ice Consulting
"... This paper describes several innovative approaches to transforming markets for energy-efficient windows, primarily in the replacement market, but also affecting new construction practice. The paper is based on actual program and field experience for a major California program, with lessons learned a ..."
Abstract - Add to MetaCart
This paper describes several innovative approaches to transforming markets for energy-efficient windows, primarily in the replacement market, but also affecting new construction practice. The paper is based on actual program and field experience for a major California program, with lessons learned

Energy-efficient mobile robot exploration

by Yongguo Mei, Yung-hsiang Lu, C. S. George Lee, Y. Charlie Hu - In Proc. of the IEEE intl. conf. on robotics and automation (ICRA , 2006
"... Abstract — Mobile robots can be used in many applications, including exploration in an unknown area. Robots usually carry limited energy so energy conservation is vital. This paper presents an approach for energy-efficient robot exploration. Our approach determines the next target for the robot to v ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
Abstract — Mobile robots can be used in many applications, including exploration in an unknown area. Robots usually carry limited energy so energy conservation is vital. This paper presents an approach for energy-efficient robot exploration. Our approach determines the next target for the robot
Results 1 - 10 of 3,567