6251 search results - page 37 / 1251 » Randomness, Computability, and Density |
163
click to vote
EMMCVPR
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. We propose a vector representation approach to contour estimation from noisy data. Images are modeled as random elds composed of a set of homogeneous regions contours (bo...
149
click to vote
ICCTA
2007
IEEE
15 years 7 months ago
2007
IEEE
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
119
Voted
DAC
1995
ACM
15 years 7 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
133
Voted
NIPS
2008
15 years 4 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
196
click to vote
WIOPT
2011
IEEE
14 years 7 months ago
2011
IEEE
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...