1105 search results - page 157 / 221 » Linear choosability of graphs |
OOPSLA
2010
Springer
14 years 10 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 10 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-...
110
click to vote
TKDE
2011
14 years 6 months ago
2011
—Previous studies have demonstrated that document clustering performance can be improved significantly in lower dimensional linear subspaces. Recently, matrix factorization base...
130
click to vote
JMLR
2010
14 years 6 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...
TIT
2010
14 years 6 months ago
2010
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...