7228 search results - page 1033 / 1446 » From Algorithmic to Subjective Randomness |
138
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
139
click to vote
ESA
1999
Springer
15 years 8 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
145
Voted
HRI
2007
ACM
15 years 8 months ago
2007
ACM
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...
171
Voted
DAC
2010
ACM
15 years 7 months ago
2010
ACM
Effective system verification requires good specifications. The lack of sufficient specifications can lead to misses of critical bugs, design re-spins, and time-to-market slips. I...
141
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...