Sciweavers

467 search results - page 57 / 94
» Roadmap of Infinite Results
Sort
View
MOC
2000
80views more  MOC 2000»
13 years 9 months ago
A modification of Shanks' baby-step giant-step algorithm
Abstract. I describe a modification to Shanks' baby-step giant-step algorithm for computing the order n of an element g of a group G, assuming n is finite. My method has the a...
David C. Terr
JIFS
2002
60views more  JIFS 2002»
13 years 9 months ago
Turing's analysis of computation and artificial neural networks
A novel way to simulate Turing Machines (TMs) by Artificial Neural Networks (ANNs) is proposed. We claim that the proposed simulation is in agreement with the correct interpretatio...
Wilson Rosa de Oliveira, Marcílio Carlos Pe...
ICRA
2010
IEEE
179views Robotics» more  ICRA 2010»
13 years 8 months ago
Needle path planning for digital breast tomosynthesis biopsy
This paper presents a new needle path planning method for digital breast tomosynthesis biopsy. Needle insertion planning into deformable tissue for breast biopsy procedure is a cha...
Laurence Vancamberg, Anis Sahbani, Serge Muller, G...
LPAR
2010
Springer
13 years 8 months ago
On the Satisfiability of Two-Variable Logic over Data Words
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
Claire David, Leonid Libkin, Tony Tan
FORTE
2009
13 years 7 months ago
Approximated Context-Sensitive Analysis for Parameterized Verification
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...