Sciweavers

4745 search results - page 8 / 949
» Discretization: An Enabling Technique
Sort
View
COMPGEOM
2001
ACM
13 years 11 months ago
Efficient and small representation of line arrangements with applications
This paper addresses the problem of lossy compression of arrangements. Given an arrangement of n lines in the plane, we show how to construct another arrangement consisting of man...
David P. Dobkin, Ayellet Tal
ICFEM
2010
Springer
13 years 6 months ago
Making the Right Cut in Model Checking Data-Intensive Timed Systems
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
Rüdiger Ehlers, Michael Gerke 0002, Hans-J&ou...
COR
2006
97views more  COR 2006»
13 years 7 months ago
Evaluating the performance of cost-based discretization versus entropy- and error-based discretization
Discretization is defined as the process that divides continuous numeric values into intervals of discrete categorical values. In this article, the concept of cost-based discretiz...
Davy Janssens, Tom Brijs, Koen Vanhoof, Geert Wets
ICIP
2003
IEEE
14 years 9 months ago
A second-order PDE technique to construct distance functions with more accurate derivatives
In this paper we demonstrate the use of an anisotropic PDE to improve the behavior of first and second derivatives of a distance function. We begin by deriving a property of these...
Siddharth Manay, Anthony J. Yezzi
CHI
2008
ACM
13 years 9 months ago
Toped: enabling end-user programmers to validate data
Existing tools require end-user programmers (EUPs) to write regular expressions ("regexps") or even scripts to validate textual inputs, which is slow and error-prone. We...
Christopher Scaffidi, Brad A. Myers, Mary Shaw