Sciweavers

1095 search results - page 48 / 219
» Preprocessing of Intractable Problems
Sort
View
JCDCG
2004
Springer
14 years 3 months ago
Farthest-Point Queries with Geometric and Combinatorial Constraints
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexande...
ISW
1999
Springer
14 years 2 months ago
Region-Based Watermarking for Images
There is a spate of research activities investigating digital image watermarking schemes in an effort to control the problem of illegal proliferation of creative digital data acros...
Gareth Brisbane, Reihaneh Safavi-Naini, Philip Ogu...
CCCG
2007
13 years 11 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
PAMI
2010
249views more  PAMI 2010»
13 years 8 months ago
Fast Keypoint Recognition Using Random Ferns
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Michael Calonder, Vincent Le...
LPNMR
2009
Springer
14 years 4 months ago
Belief Revision with Bounded Treewidth
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...