3379 search results - page 258 / 676 » Combinators for Interaction Nets |
174
click to vote
COMPGEOM
1993
ACM
15 years 10 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
200
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
We provide a new theoretical framework for constructing Steiner routing trees with minimum Elmore delay. Earlier work [3, 13] has established Elmore delay as a high delity estima...
179
click to vote
ISARCS
2010
15 years 10 months ago
2010
Abstract. Software designs equipped with specification of dependability techniques can help engineers to develop critical systems. In this work, we start to envision how a softwar...
178
click to vote
BPM
2006
Springer
15 years 10 months ago
2006
Springer
An important shortcoming in the Business Process Redesign (BPR) literature is the lack of concrete guidance on how to improve an existing business process. Our earlier work has aim...
187
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
Classification algorithms and document representation approaches are two key elements for a successful document classification system. In the past, much work has been conducted to...