501 search results - page 95 / 101 » An Upper Bound on the Number of Rectangulations of a Point S... |
GD
2005
Springer
14 years 1 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
TIP
2008
13 years 7 months ago
2008
Abstract--Local learning methods, such as local linear regression and nearest neighbor classifiers, base estimates on nearby training samples, neighbors. Usually, the number of nei...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions (...
COLT
2003
Springer
14 years 22 days ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
RANDOM
1999
Springer
13 years 11 months ago
1999
Springer
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...