501 search results - page 79 / 101 » An Upper Bound on the Number of Rectangulations of a Point S... |
GD
2004
Springer
14 years 28 days ago
2004
Springer
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...
TSP
2010
13 years 2 months ago
2010
Abstract--This paper investigates the impulse response estimation of linear time-invariant (LTI) systems when only noisy finitelength input-output data of the system is available. ...
CCCG
2006
13 years 9 months ago
2006
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
CSFW
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we focus on tackling the insecurity problem of security protocols in the presence of an unbounded number of data such as nonces or session keys. First, we pinpoint f...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...