Results 1  10
of
670
ANL/MCSTM202 A Case Study in Automated Theorem Proving: A Dicult Problem about Commutators
, 1995
"... Contract W31109Eng38. Contents ..."
Language Support for Lightweight Transactions
, 2003
"... Concurrent programming is notoriously di#cult. Current abstractions are intricate and make it hard to design computer systems that are reliable and scalable. We argue that these problems can be addressed by moving to a declarative style of concurrency control in which programmers directly indicate t ..."
Abstract

Cited by 482 (16 self)
 Add to MetaCart
Concurrent programming is notoriously di#cult. Current abstractions are intricate and make it hard to design computer systems that are reliable and scalable. We argue that these problems can be addressed by moving to a declarative style of concurrency control in which programmers directly indicate
A New Point Matching Algorithm for NonRigid Registration
, 2002
"... Featurebased methods for nonrigid registration frequently encounter the correspondence problem. Regardless of whether points, lines, curves or surface parameterizations are used, featurebased nonrigid matching requires us to automatically solve for correspondences between two sets of features. I ..."
Abstract

Cited by 356 (3 self)
 Add to MetaCart
. In addition, there could be many features in either set that have no counterparts in the other. This outlier rejection problem further complicates an already di#cult correspondence problem. We formulate featurebased nonrigid registration as a nonrigid point matching problem. After a careful review
Sparse Principal Component Analysis
 Journal of Computational and Graphical Statistics
, 2004
"... Principal component analysis (PCA) is widely used in data processing and dimensionality reduction. However, PCA su#ers from the fact that each principal component is a linear combination of all the original variables, thus it is often di#cult to interpret the results. We introduce a new method ca ..."
Abstract

Cited by 279 (6 self)
 Add to MetaCart
Principal component analysis (PCA) is widely used in data processing and dimensionality reduction. However, PCA su#ers from the fact that each principal component is a linear combination of all the original variables, thus it is often di#cult to interpret the results. We introduce a new method
Reasoning about beliefs and actions under computational resource constraints
 in Proceedings of the 1989 Workshop on Uncertainty and AI
, 1987
"... Although many investigators arm a desire to build reasoning systems that behave consistently with the axiomatic basis dened by probability theory and utility theory, limited resources for engineering and computation can make a complete normative analysis impossible. We attempt to move discussion be ..."
Abstract

Cited by 219 (22 self)
 Add to MetaCart
on the application of knowledge about the expected timewiserenement abilities of reasoning strategies to balance the bene ts of additional computation with the costs of acting with a partial result. We discuss the benets of applying decision theory to control the solution of dicult problems given limitations
Computing Occluding and Transparent Motions
 International Journal of Computer Vision
, 1994
"... Computing the motions of several moving objects in image sequences involves simultaneous motion analysis and segmentation. This task can become complicated when image motion changes signi#cantly between frames, as with camera vibrations. Such vibrations make tracking in longer sequences harder, as t ..."
Abstract

Cited by 243 (25 self)
 Add to MetaCart
, as temporal motion constancy can not be assumed. The problem becomes even more di#cult in the case of transparent motions.
Microarrays, Empirical Bayes Methods, and False Discovery Rates
 Genet. Epidemiol
, 2001
"... In a classic twosample problem one might use Wilcoxon's statistic to test for a dierence between Treatment and Control subjects. The analogous microarray experiment yields thousands of Wilcoxon statistics, one for each gene on the array, and confronts the statistician with a dicult simultan ..."
Abstract

Cited by 217 (14 self)
 Add to MetaCart
In a classic twosample problem one might use Wilcoxon's statistic to test for a dierence between Treatment and Control subjects. The analogous microarray experiment yields thousands of Wilcoxon statistics, one for each gene on the array, and confronts the statistician with a dicult
A signal correlation guided ATPG solver and its applications for solving dicult industrial cases
 Proc. DAC `03
"... The developments of efficient SAT solvers have attracted tremendous research interest in recent years. The merits of these solvers are often compared in terms of their performance based upon a wide spread of benchmarks. In this paper, we extend an earlierproposed solver design concept called (SCGL ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
(SCGL) Signal Correlation Guided Learning that is ATPGbased into a family of heuristics. Along with this SCGL family of heuristics, we classify benchmark examples according to their performance using the SCGL heuristics. With this study, we identify the class of problems that are uniquely suitable
The \Moving Targets " Algorithm for Dicult Temporal Credit Assignment Problems Presentation for the workshop: Neural Networks for Statistical and Economic Data
, 1990
"... The \moving targets " algorithm for training recurrent networks is reviewed and applied to a task which demonstrates the ability of this algorithm to use distant contextual information. Some practical diculties are discussed, especially with regard to the minimization process. Results on perf ..."
Abstract
 Add to MetaCart
on performance and computational requirements of several dierent 2ndorder minimization algorithms are presented for moving target problems. 1
Metropolis Light Transport
 Computer Graphics (SIGGRAPH '97 Proceedings
, 1997
"... We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a sequence of light transport paths by randomly mutating a single current path (e.g. adding a new vertex to the path). Eac ..."
Abstract

Cited by 203 (1 self)
 Add to MetaCart
, handles general geometric and scattering models, uses little storage, and can be orders of magnitude more e#cient than previous unbiased approaches. It performs especially well on problems that are usually considered di#cult, e.g. those involving bright indirect light, small geometric holes, or glossy
Results 1  10
of
670