1067 search results - page 95 / 214 » Probabilistic regular graphs |
144
click to vote
TCSV
2002
15 years 2 months ago
2002
Video query by semantic keywords is one of the most challenging research issues in video data management. To go beyond low-level similarity and access video data content by semanti...
123
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
133
click to vote
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
142
click to vote
SRDS
2010
IEEE
15 years 29 days ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
125
click to vote
NIPS
2001
15 years 4 months ago
2001
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...