4761 search results - page 91 / 953 » Generalizing Boundary Points |
SODA
2007
ACM
13 years 9 months ago
2007
ACM
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
CHI
2011
ACM
12 years 11 months ago
2011
ACM
We present the Pointing Magnifier as a case study for understanding the issues and challenges of deploying lab-validated pointing facilitation techniques into the real world. The ...
ITP
2010
14 years 2 days ago
2010
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon operator. This combinator allows for a direct and e...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Consider a set of signals fs : {1, . . . , N} [0, . . . , M] appearing as a stream of tuples (i, fs(i)) in arbitrary order of i and s. We would like to devise one pass approximat...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A mobile robot, represented by a point moving along a polygonal line in the plane, has to explore an unknown polygon and return to the starting point. The robot has a sen...