Sciweavers

680 search results - page 90 / 136
» Computational Complexity and Anytime Algorithm for Inconsist...
Sort
View
CVPR
2007
IEEE
14 years 10 months ago
Gradient Intensity: A New Mutual Information-Based Registration Method
Conventional mutual information (MI)-based registration using pixel intensities is time-consuming and ignores spatial information, which can lead to misalignment. We propose a met...
Ramtin Shams, Parastoo Sadeghi, Rodney A. Kennedy
ICRA
2002
IEEE
146views Robotics» more  ICRA 2002»
14 years 28 days ago
Real-Time Combinatorial Tracking of a Target Moving Unpredictably among Obstacles
Abstract—Many applications require continuous monitoring of a moving target by a controllable vision system. Although the goal of tracking objects is not new, traditional techniq...
Héctor H. González-Baños, Che...
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
11 years 10 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
FOCS
2008
IEEE
14 years 2 months ago
Learning Geometric Concepts via Gaussian Surface Area
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio
SAC
2006
ACM
14 years 1 months ago
J2EE server scalability through EJB replication
With the development of Internet-based business, Web applications are becoming increasingly complex. The J2EE specification aims at enabling the design of such web application ser...
Sylvain Sicard, Noel De Palma, Daniel Hagimont