Sciweavers

1153 search results - page 148 / 231
» Reversing graph transformations
Sort
View
SGP
2004
14 years 13 days ago
Shape Segmentation Using Local Slippage Analysis
We propose a method for segmentation of 3D scanned shapes into simple geometric parts. Given an input point cloud, our method computes a set of components which possess one or mor...
Natasha Gelfand, Leonidas J. Guibas
COLING
1990
13 years 11 months ago
A Spelling Correction Program Based on a Noisy Channel Model
This paper describes a new program, correct, which takes words rejected by the Unix spell program, proposes a list of candidate corrections, and sorts them by probability. The pro...
Mark D. Kernighan, Kenneth Ward Church, William A....
COMPUTER
2008
92views more  COMPUTER 2008»
13 years 10 months ago
Can Programming Be Liberated, Period?
higher, more appropriate, level of abstraction. It still entails writing programs, usually by using symbols, keywords, and operational instructions to tell the computer what we wan...
David Harel
CORR
2008
Springer
82views Education» more  CORR 2008»
13 years 10 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
IJNSEC
2008
103views more  IJNSEC 2008»
13 years 10 months ago
On Cipher Design Based on Switchable Controlled Operations
This paper concerns the problem of reducing the implementation cost of the switchable data-dependent operations (SDDOs) that are a new cryptographic primitive oriented to the desi...
Nikolay A. Moldovyan