Sciweavers

3146 search results - page 81 / 630
» Efficient Consequence Finding
Sort
View
ESA
2000
Springer
110views Algorithms» more  ESA 2000»
14 years 1 months ago
Polygon Decomposition for Efficient Construction of Minkowski Sums
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...
Pankaj K. Agarwal, Eyal Flato, Dan Halperin
ASYNC
1997
IEEE
103views Hardware» more  ASYNC 1997»
14 years 1 months ago
Efficient Timing Analysis Algorithms for Timed State Space Exploration
This paper presents new timing analysis algorithms for efficient state space exploration during timed circuit synthesis. Timed circuits are a class of asynchronous circuits that i...
Wendy Belluomini, Chris J. Myers
CCCG
2010
13 years 11 months ago
Towards a dynamic data structure for efficient bounded line range search
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
Thuy Le, Bradford G. Nickerson
MEDIAFORENSICS
2010
13 years 11 months ago
Efficient estimation of CFA pattern configuration in digital camera images
This paper proposes an efficient method to determine the concrete configuration of the color filter array (CFA) from demosaiced images. This is useful to decrease the degrees of f...
Matthias Kirchner
IAT
2008
IEEE
13 years 10 months ago
A Game-Theoretic Approach to Determining Efficient Patrolling Strategies for Mobile Robots
Use of game-theoretic models to address patrolling applications has gained increasing interest in the very last years. The patrolling agent is considered playing a game against an...
Francesco Amigoni, Nicola Gatti, Antonio Ippedico