2434 search results - page 134 / 487 » Algorithmic Randomness of Closed Sets |
123
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
138
click to vote
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
116
Voted
CCS
2003
ACM
15 years 8 months ago
2003
ACM
We describe a new, general approach for safeguarding systems against any type of code-injection attack. We apply Kerckhoff’s principle, by creating process-specific randomized ...
108
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
125
Voted
GCB
2000
Springer
15 years 7 months ago
2000
Springer
We describe an algorithm for the automatic discovery of recurring patterns in protein structures. The patterns consist of individual residues having a defined order along the prote...