Sciweavers

231 search results - page 9 / 47
» On overlays and minimization diagrams
Sort
View
WIA
2005
Springer
15 years 3 months ago
Minimization of Non-deterministic Automata with Large Alphabets
There has been several attempts over the years to solve the bisimulation minimization problem for finite automata. One of the most famous algorithms is the one suggested by Paige ...
Parosh Aziz Abdulla, Johann Deneux, Lisa Kaati, Ma...
DAC
1999
ACM
15 years 1 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
COMPGEOM
1993
ACM
15 years 1 months ago
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
Rolf Klein, Andrzej Lingas
DSN
2006
IEEE
15 years 3 months ago
Improving the Fault Resilience of Overlay Multicast for Media Streaming
This paper addresses the problem of fault resilience of overlay-based live media streaming from two aspects: (1) how to construct a stable multicast tree that minimizes the negati...
Guang Tan, Stephen A. Jarvis, Daniel P. Spooner
NIPS
2008
14 years 11 months ago
Overlaying classifiers: a practical approach for optimal ranking
ROC curves are one of the most widely used displays to evaluate performance of scoring functions. In the paper, we propose a statistical method for directly optimizing the ROC cur...
Stéphan Clémençon, Nicolas Va...