Sciweavers

6142 search results - page 145 / 1229
» The Complexity of Partition Functions
Sort
View
CPC
1998
91views more  CPC 1998»
14 years 9 months ago
Complexity and Probability of Some Boolean Formulas
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
Petr Savický
EMMCVPR
2011
Springer
13 years 9 months ago
The Complex Wave Representation of Distance Transforms
The complex wave representation (CWR) converts unsigned 2D distance transforms into their corresponding wave functions. The underlying motivation for performing this maneuver is as...
Karthik S. Gurumoorthy, Anand Rangarajan, Arunava ...
DATE
2000
IEEE
139views Hardware» more  DATE 2000»
15 years 2 months ago
Target Architecture Oriented High-Level Synthesis for Multi-FPGA Based Emulation
This paper presents a new approach on combined highlevel synthesis and partitioning for FPGA-based multi-chip emulation systems. The goal is to synthesize a prototype with maximal...
Oliver Bringmann, Wolfgang Rosenstiel, Carsten Men...
ICALP
1998
Springer
15 years 2 months ago
Optimal Sampling Strategies in Quicksort
It is well known that the performance of quicksort can be improved by selecting the median of a sample of elements as the pivot of each partitioning stage. For large samples the pa...
Conrado Martínez, Salvador Roura
EMNLP
2008
14 years 11 months ago
Seeded Discovery of Base Relations in Large Corpora
Relationship discovery is the task of identifying salient relationships between named entities in text. We propose novel approaches for two sub-tasks of the problem: identifying t...
Nicholas Andrews, Naren Ramakrishnan