2430 search results - page 437 / 486 » Computing Tutte Polynomials |
DCOSS
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
SIGGRAPH
1995
ACM
14 years 1 months ago
1995
ACM
The use of prediction to eliminate or reduce the effects of system delays in Head-Mounted Display systems has been the subject of several recent papers. A variety of methods have ...
NIPS
2001
13 years 11 months ago
2001
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
ATAL
2010
Springer
13 years 11 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
CONCUR
2010
Springer
13 years 11 months ago
2010
Springer
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...