4372 search results - page 218 / 875 » Algorithmic Theories of Everything |
127
Voted
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
91
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
— Trust management, broadly intended as the ability to maintain belief relationship among entities, is recognized as a fundamental security challenge for autonomous and selforgan...
100
click to vote
SIAMAM
2002
15 years 15 days ago
2002
The theory of periodic wavelet transforms presented here was originally developed to deal with the problem of epileptic seizure prediction. A central theorem in the theory is the c...
130
click to vote
AAAI
2012
13 years 3 months ago
2012
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
132
Voted
PODS
2006
ACM
16 years 29 days ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...