2478 search results - page 356 / 496 » Universality in two dimensions |
118
click to vote
SIGSOFT
2005
ACM
16 years 1 months ago
2005
ACM
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
97
Voted
WEBI
2009
Springer
15 years 7 months ago
2009
Springer
Filtering feature selection method (filtering method, for short) is a well-known feature selection strategy in pattern recognition and data mining. Filtering method outperforms ot...
133
click to vote
IWCIA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
103
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
110
Voted
SMA
2006
ACM
15 years 6 months ago
2006
ACM
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...