Sciweavers

1702 search results - page 54 / 341
» Using Nondeterminism to Design Efficient Deterministic Algor...
Sort
View
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
14 years 9 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
DAC
2008
ACM
14 years 8 months ago
Partial order reduction for scalable testing of systemC TLM designs
A SystemC simulation kernel consists of a deterministic implementation of the scheduler, whose specification is nondeterministic. To leverage testing of a SystemC TLM design, we f...
Sudipta Kundu, Malay K. Ganai, Rajesh Gupta
CRYPTO
2003
Springer
124views Cryptology» more  CRYPTO 2003»
14 years 29 days ago
Primality Proving via One Round in ECPP and One Iteration in AKS
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
Qi Cheng
ICGI
2010
Springer
13 years 5 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer
DAC
2009
ACM
14 years 8 months ago
A robust and efficient harmonic balance (HB) using direct solution of HB Jacobian
In this paper we introduce a new method of performing direct solution of the harmonic balance Jacobian. For examples with moderate number of harmonics and moderate to strong nonli...
Amit Mehrotra, Abhishek Somani