Sciweavers

1763 search results - page 157 / 353
» A Formalization of Polytime Functions
Sort
View
APLAS
2009
ACM
15 years 10 months ago
A Short Cut to Optimal Sequences
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...
Akimasa Morihata
ISVLSI
2007
IEEE
131views VLSI» more  ISVLSI 2007»
15 years 10 months ago
Improving the Quality of Bounded Model Checking by Means of Coverage Estimation
Formal verification has become an important step in circuit and system design. A prominent technique is Bounded Model Checking (BMC) which is widely used in industry. In BMC it i...
Ulrich Kühne, Daniel Große, Rolf Drechs...
ECML
2007
Springer
15 years 10 months ago
An Unsupervised Learning Algorithm for Rank Aggregation
Many applications in information retrieval, natural language processing, data mining, and related fields require a ranking of instances with respect to a specified criteria as op...
Alexandre Klementiev, Dan Roth, Kevin Small
ICANN
2007
Springer
15 years 10 months ago
Neural Network Processing for Multiset Data
Abstract. This paper introduces the notion of the variadic neural network (VNN). The inputs to a variadic network are an arbitrary-length list of n-tuples of real numbers, where n ...
Simon McGregor
DATE
2006
IEEE
96views Hardware» more  DATE 2006»
15 years 10 months ago
A methodology for FPGA to structured-ASIC synthesis and verification
Structured-ASIC design provides a mid-way point between FPGA and cell-based ASIC design for performance, area and power, but suffers from the same increasing verification burden a...
Michael Hutton, Richard Yuan, Jay Schleicher, Greg...