Sciweavers

746 search results - page 69 / 150
» Fast (Structured) Newton Computations
Sort
View
ECCV
2006
Springer
15 years 1 days ago
Triangulation for Points on Lines
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
Adrien Bartoli, Jean-Thierry Lapresté
JAIR
2006
179views more  JAIR 2006»
13 years 10 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
TKDE
2008
137views more  TKDE 2008»
13 years 10 months ago
GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks
Abstract-- In peer-to-peer (P2P) networks, reputation aggregation and peer ranking are the most time-consuming and spacedemanding operations. This paper proposes a gossip-based rep...
Runfang Zhou, Kai Hwang, Min Cai
SEUS
2010
IEEE
13 years 8 months ago
Crash Recovery in FAST FTL
NAND flash memory is one of the non-volatile memories and has been replacing hard disk in various storage markets from mobile devices, PC/Laptop computers, even to enterprise serv...
Sungup Moon, Sang-Phil Lim, Dong-Joo Park, Sang-Wo...
SMA
2008
ACM
182views Solid Modeling» more  SMA 2008»
13 years 10 months ago
Voronoi diagram computations for planar NURBS curves
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
Joon-Kyung Seong, Elaine Cohen, Gershon Elber