• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 10,942
Next 10 →

Lucas-Kanade 20 Years On: A Unifying Framework: Part 3

by Simon Baker, Ralph Gross, Iain Matthews - International Journal of Computer Vision , 2002
"... Since the Lucas-Kanade algorithm was proposed in 1981 image alignment has become one of the most widely used techniques in computer vision. Applications range from optical flow, tracking, and layered motion, to mosaic construction, medical image registration, and face coding. Numerous algorithms hav ..."
Abstract - Cited by 706 (30 self) - Add to MetaCart
have been proposed and a variety of extensions have been made to the original formulation. We present an overview of image alignment, describing most of the algorithms in a consistent framework. We concentrate on the inverse compositional algorithm, an efficient algorithm that we recently proposed. We

Unified Framework for . . .

by M. S. Alnæs, A. Logg, K.-A. Mardal, O. Skavhaug, H. P. Langtangen
"... Over the last fifty years, the finite element method has emerged as a successful methodology for solving a wide range of partial differential equations. At the heart of any finite element simulation is the assembly of matrices and vectors from finite element variational forms. In this paper, we pre ..."
Abstract - Add to MetaCart
present a general and unified framework for finite element assembly. Based on this framework, we propose a specific software interface (UFC) between problem-specific and general-purpose components of finite element programs. The interface is general in the sense that it applies to a wide range of finite

A unified framework for monetary theory and policy analysis.

by Ricardo Lagos , Randall Wright - Journal of Political Economy, , 2005
"... Search-theoretic models of monetary exchange are based on explicit descriptions of the frictions that make money essential. However, tractable versions of these models typically make strong assumptions that render them ill suited for monetary policy analysis. We propose a new framework, based on ex ..."
Abstract - Cited by 375 (53 self) - Add to MetaCart
Search-theoretic models of monetary exchange are based on explicit descriptions of the frictions that make money essential. However, tractable versions of these models typically make strong assumptions that render them ill suited for monetary policy analysis. We propose a new framework, based

Unified framework for . . .

by Omar Shatnawi, ANU G. AGGARWAL, RAVI KUMAR, et al. , 2009
"... Several software reliability growth models (SRGMs) have been presented in the literature in the last three decades. These SRGMs take into account different testing environment depending on size and efficiency of testing team, type of components and faults, design of test cases, software architectu ..."
Abstract - Add to MetaCart
. In this paper, we propose a unified framework for testing effort dependent software reliability growth models incorporating imperfect debugging and error generation. The proposed framework represents the realistic case of time delays between the different stages of fault removal process i.e Failure Observation

Bucket Elimination: A Unifying Framework for Reasoning

by Rina Dechter
"... Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolution for propositional satisfiability, adaptive-consistency for constraint satisfaction, Fourier and Gaussian elimination ..."
Abstract - Cited by 298 (58 self) - Add to MetaCart
constraint satisfaction), and branch and bound (for combinatorial optimization). The paper presents the bucket-elimination framework as a unifying theme across probabilistic and deterministic reasoning tasks and show how conditioning search can be augmented to systematically trade space for time.

Bucket Elimination: A Unifying Framework for Probabilistic Inference

by Rina Dechter , 1996
"... Probabilistic inference algorithms for belief updating, finding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated within the bucket elimination framework. This emphasizes the principles common to many of the algorithms appearing in ..."
Abstract - Cited by 294 (27 self) - Add to MetaCart
Probabilistic inference algorithms for belief updating, finding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated within the bucket elimination framework. This emphasizes the principles common to many of the algorithms appearing

Mining with Rarity: A Unifying Framework

by Gary M. Weiss
"... Rare objects are often of great interest and great value. Until recently, however, rarity has not received much attention in the context of data mining. Now, as increasingly complex real-world problems are addressed, rarity, and the related problem of imbalanced data, are taking center stage. This a ..."
Abstract - Cited by 206 (6 self) - Add to MetaCart
Rare objects are often of great interest and great value. Until recently, however, rarity has not received much attention in the context of data mining. Now, as increasingly complex real-world problems are addressed, rarity, and the related problem of imbalanced data, are taking center stage. This article discusses the role that rare classes and rare cases play in data mining. The problems that can result from these two forms of rarity are described in detail, as are methods for addressing these problems. These descriptions utilize examples from existing research, so that this article provides a good survey of the literature on rarity in data mining. This article also demonstrates that rare classes and rare cases are very similar phenomena---both forms of rarity are shown to cause similar problems during data mining and benefit from the same remediation methods.

A Unified Framework for Measuring Preferences for Schools and Neighborhoods

by Patrick Bayer, Fernando Ferreira, Robert McMillan , 2007
"... This paper develops a framework for estimating household preferences for school and neighborhood attributes in the presence of sorting. It embeds a boundary discontinuity design in a heterogeneous residential choice model, addressing the endogeneity of school and neighborhood characteristics. The mo ..."
Abstract - Cited by 219 (18 self) - Add to MetaCart
This paper develops a framework for estimating household preferences for school and neighborhood attributes in the presence of sorting. It embeds a boundary discontinuity design in a heterogeneous residential choice model, addressing the endogeneity of school and neighborhood characteristics

A Unified Framework for Hybrid Control: Model and Optimal Control Theory

by Michael S. Branicky, Vivek S. Borkar, Sanjoy K. Mitter - IEEE TRANSACTIONS ON AUTOMATIC CONTROL , 1998
"... Complex natural and engineered systems typically possess a hierarchical structure, characterized by continuousvariable dynamics at the lowest level and logical decision-making at the highest. Virtually all control systems today---from flight control to the factory floor---perform computer-coded chec ..."
Abstract - Cited by 305 (9 self) - Add to MetaCart
-coded checks and issue logical as well as continuous-variable control commands. The interaction of these different types of dynamics and information leads to a challenging set of "hybrid" control problems. We propose a very general framework that systematizes the notion of a hybrid system, combining

A Unified Framework and Algorithm for Channel Assignment

by S. Ramanathan - in Wireless Networks”, Wireless Networks, Volume 5, Issue 2 , 1999
"... Channel assignment problems in the time, frequency and code domains have thus far been studied separately. Exploiting the similarity of constraints that characterize assignments within and across these domains, we introduce the first unified framework for the study of assignment problems. Our framew ..."
Abstract - Cited by 150 (0 self) - Add to MetaCart
Channel assignment problems in the time, frequency and code domains have thus far been studied separately. Exploiting the similarity of constraints that characterize assignments within and across these domains, we introduce the first unified framework for the study of assignment problems. Our
Next 10 →
Results 1 - 10 of 10,942
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University