Sciweavers

2255 search results - page 20 / 451
» Computing a Center-Transversal Line
Sort
View
CCCG
2007
13 years 9 months ago
Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
Arindam Karmakar, Sasanka Roy, Sandip Das
ICMCS
2006
IEEE
122views Multimedia» more  ICMCS 2006»
14 years 1 months ago
An Improved Approach to the Line-Based Face Recognition
The line-based face recognition method is distinguished by its features, but its development and application is limited to some inherent drawbacks. This paper propose a method for...
Anlong Ming, Huadong Ma
AAAI
2012
11 years 10 months ago
Computing Optimal Strategies to Commit to in Stochastic Games
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
Joshua Letchford, Liam MacDermed, Vincent Conitzer...
ICRA
2010
IEEE
106views Robotics» more  ICRA 2010»
13 years 6 months ago
Computing push plans for disk-shaped robots
Suppose we want to move a passive object along a given path, among obstacles in the plane, by pushing it with an active robot. We present two algorithms to compute a push plan for...
Mark de Berg, Dirk H. P. Gerrits
ARITH
1999
IEEE
13 years 11 months ago
On the Design of High-Radix On-Line Division for Long Precision
We present a design of a high-radix on-line division suitable for long precision computations. The proposed scheme uses a quotient-digit selection function based on the residual r...
Alexandre F. Tenca, Milos D. Ercegovac