Sciweavers

1185 search results - page 37 / 237
» The Equivalence of Sampling and Searching
Sort
View
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 7 months ago
Inverting a permutation is as hard as unordered search
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
Ashwin Nayak
PARA
2000
Springer
13 years 11 months ago
GRISK: An Internet Based Search for K-Optimal Lattice Rules
Abstract. This paper describe the implementation and underlying philosophie of a large scale distributed computation of K-optimal lattice rules. The computation is huge correspondi...
Tor Sørevik, Jan Frode Myklebust
ADG
2006
Springer
204views Mathematics» more  ADG 2006»
14 years 1 months ago
Algorithmic Search for Flexibility Using Resultants of Polynomial Systems
This paper describes the recent convergence of four topics: polynomial systems, flexibility of three dimensional objects, computational chemistry, and computer algebra. We discuss...
Robert H. Lewis, Evangelos A. Coutsias
NSF
2001
Springer
141views Computer Vision» more  NSF 2001»
14 years 5 days ago
Mobile Wireless Interfaces: In Search for the Limits
With the proliferation of 2G and 3G Telecom and other wireless networks hundred of millions of users will be able to access wireless services with their terminals in only a few yea...
Jari Veijalainen, Tom Gross
TIT
2008
107views more  TIT 2008»
13 years 7 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak