1105 search results - page 127 / 221 » Linear choosability of graphs |
165
Voted
JMLR
2012
13 years 7 months ago
2012
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
161
Voted
SDM
2012
SIAM
13 years 7 months ago
2012
SIAM
With the growth of the Internet and E-commerce, bipartite rating networks are ubiquitous. In such bipartite rating networks, there exist two types of entities: the users and the o...
149
Voted
AAAI
2007
15 years 7 months ago
2007
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
133
click to vote
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (contPN). Specifically, we consider two problems: (1) given an initial set o...
137
Voted
JSYML
2007
15 years 4 months ago
2007
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...