210 search results - page 3 / 42 » Uniform regular enumerations |
TCS
2008
13 years 5 months ago
2008
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
ICDT
2012
ACM
11 years 8 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
CPC
2006
13 years 5 months ago
2006
Abstract. The main results of this paper are regularity and counting lemmas for 3uniform hypergraphs. A combination of these two results gives a new proof of a theorem of Frankl an...
COLT
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. The regularization functional induced by the graph Laplacian of a random neighborhood graph based on the data is adaptive in two ways. First it adapts to an underlying ma...
NETWORKING
2004
13 years 7 months ago
2004
This paper presents an analytical methodology to obtain steady state throughput of a uniformly and fully loaded regular network. The network operates using deflection routing under...