Sciweavers

903 search results - page 39 / 181
» On the reduction of a random basis
Sort
View
97
Voted
INFORMATICALT
2007
43views more  INFORMATICALT 2007»
15 years 1 months ago
Functional Test Generation Based on Combined Random and Deterministic Search Methods
Abstract. The aim of this paper is to explore some features of the functional test generation problem, and on the basis of the gained experience, to propose a practical method for ...
Eduardas Bareisa, Vacius Jusas, Kestutis Motiejuna...
JMLR
2006
143views more  JMLR 2006»
15 years 1 months ago
Segmental Hidden Markov Models with Random Effects for Waveform Modeling
This paper proposes a general probabilistic framework for shape-based modeling and classification of waveform data. A segmental hidden Markov model (HMM) is used to characterize w...
Seyoung Kim, Padhraic Smyth
JCSS
1998
51views more  JCSS 1998»
15 years 1 months ago
Randomized Query Processing in Robot Path Planning
d Abstract) LYDIA E. KAVRAKI   JEAN-CLAUDE LATOMBE   RAJEEV MOTWANI ¡ PRABHAKAR RAGHAVAN ¢ The subject of this paper is the analysis of a randomized preprocessing scheme that ...
Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motw...
WAIFI
2010
Springer
192views Mathematics» more  WAIFI 2010»
15 years 7 months ago
Type-II Optimal Polynomial Bases
In the 1990s and early 2000s several papers investigated the relative merits of polynomial-basis and normal-basis computations for F2n . Even for particularly squaring-friendly app...
Daniel J. Bernstein, Tanja Lange
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
15 years 6 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert