1201 search results - page 173 / 241 » Linear Probing and Graphs |
102
Voted
JCT
2010
14 years 11 months ago
2010
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
103
click to vote
OOPSLA
2010
Springer
14 years 11 months ago
2010
Springer
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
RFIDSEC
2010
14 years 11 months ago
2010
RFID authentication protocols are susceptible to different types of relay attacks such as mafia and distance frauds. A countermeasure against these types of attacks are the well-...
118
click to vote
TKDE
2011
14 years 7 months ago
2011
—Previous studies have demonstrated that document clustering performance can be improved significantly in lower dimensional linear subspaces. Recently, matrix factorization base...
141
Voted
JMLR
2010
14 years 7 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...