85 search results - page 17 / 17 » Tight lower bounds for the size of epsilon-nets |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
ESA
2009
Springer
13 years 12 months ago
2009
Springer
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
SP
2006
IEEE
13 years 11 months ago
2006
IEEE
The MIX technique forms the basis of many popular services that offer anonymity of communication in open and shared networks such as the Internet. In this paper, fundamental limit...
ICISC
1998
13 years 6 months ago
1998
Abstract. In this paper, we introduce the concept of kth-order nonhomomorphicity of mappings or S-boxes as an alternative indicator that forecasts nonlinearity characteristics of a...
SPAA
2004
ACM
13 years 10 months ago
2004
ACM
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...