2009 search results - page 212 / 402 » Dense Interest Points |
116
click to vote
DM
2010
15 years 4 months ago
2010
Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...
149
click to vote
AAECC
2006
Springer
15 years 4 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
109
click to vote
ENTCS
2008
15 years 4 months ago
2008
We report our experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language mega. mega is intended as both a ...
153
click to vote
ENTCS
2008
15 years 4 months ago
2008
This paper initiates the study of sets in Euclidean space Rn (n 2) that are defined in terms of the dimensions of their elements. Specifically, given an interval I [0, 1], we ar...
154
Voted
ENTCS
2006
15 years 4 months ago
2006
Program slicing is a well-known technique to extract the program statements that (potentially) affect the values computed at some point of interest. In this work, we introduce a n...