Sciweavers

11862 search results - page 35 / 2373
» Relative information completeness
Sort
View
COMPGEOM
2006
ACM
14 years 1 months ago
Complete subdivision algorithms, I: intersection of Bezier curves
We give the first complete subdivision algorithm for the intersection of two Bezier curves F, G, possibly with tangential intersections. Our approach to robust subdivision algori...
Chee-Keng Yap
JUCS
2006
94views more  JUCS 2006»
13 years 7 months ago
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
Tobias Riege, Jörg Rothe
FPL
2010
Springer
124views Hardware» more  FPL 2010»
13 years 5 months ago
Finding System-Level Information and Analyzing Its Correlation to FPGA Placement
One of the more popular placement algorithms for Field Programmable Gate Arrays (FPGAs) is called Simulated Annealing (SA). This algorithm tries to create a good quality placement ...
Farnaz Gharibian, Lesley Shannon, Peter Jamieson
IJCNN
2007
IEEE
14 years 1 months ago
Encoding Complete Body Models Enables Task Dependent Optimal Behavior
— Many neural network models of (human) motor learning focus on the acquisition of direct goal-to-action mappings, which results in rather inflexible motor control programs. We ...
Oliver Herbort, Martin V. Butz
CAIP
2003
Springer
148views Image Analysis» more  CAIP 2003»
14 years 26 days ago
Construction of Complete and Independent Systems of Rotation Moment Invariants
The problem of independence and completeness of rotation moment invariants is addressed in this paper. General method for constructing invariants of arbitrary orders by means of co...
Jan Flusser, Tomás Suk