5606 search results - page 1035 / 1122 » Randomization Techniques for Graphs. |
CHI
1993
ACM
15 years 2 months ago
1993
ACM
An adaptive user interface relies, to a large extent, upon an adequate user model (e.g., a representationof user-expertise). However, building a user model may be a tedious and ti...
DSN
2007
IEEE
15 years 1 months ago
2007
IEEE
Peer-to-peer technique has now become one of the major techniques to exchange digital content between peers of the same interest. However, as the amount of peer-topeer traffic inc...
FOCS
2007
IEEE
15 years 1 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
COCO
2006
Springer
15 years 1 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
CP
2006
Springer
15 years 1 months ago
2006
Springer
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...