Sciweavers

725 search results - page 101 / 145
» Bounding Degrees on RPL
Sort
View
DAC
1997
ACM
14 years 2 months ago
System-Level Synthesis of Low-Power Hard Real-Time Systems
We present a system-level approach for power optimization under a set of user specified costs and timing constraints of hard real-time designs. The approach optimizes all three d...
Darko Kirovski, Miodrag Potkonjak
COMPGEOM
1994
ACM
14 years 2 months ago
Matching Shapes with a Reference Point
For two given point sets, we present a very simple (almost trivial) algorithm to translate one set so that the Hausdor distance between the two sets is not larger than a constant ...
Helmut Alt, Oswin Aichholzer, Günter Rote
COMPGEOM
2007
ACM
14 years 1 months ago
Embeddings of surfaces, curves, and moving points in euclidean space
In this paper we show that dimensionality reduction (i.e., Johnson-Lindenstrauss lemma) preserves not only the distances between static points, but also between moving points, and...
Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
ECSQARU
1995
Springer
14 years 1 months ago
Parametric Structure of Probabilities in Bayesian Networks
The paper presents a method for uncertainty propagation in Bayesian networks in symbolic, as opposed to numeric, form. The algebraic structure of probabilities is characterized. Th...
Enrique Castillo, José Manuel Gutiér...
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
13 years 12 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan