Sciweavers

2310 search results - page 186 / 462
» Coloring Random Graphs
Sort
View
117
Voted
CVPR
1997
IEEE
15 years 6 months ago
FOCUS: Searching for Multi-colored Objects in a Diverse Image Database
We describe a new multi-phase, color-based image retrieval system, FOCUS Fast Object Color-based qUery System, with an online user interface which is capable of identifying mult...
Madirakshi Das, Edward M. Riseman, Bruce A. Draper
PAMI
2006
111views more  PAMI 2006»
15 years 2 months ago
Stereo Matching with Linear Superposition of Layers
In this paper, we address stereo matching in the presence of a class of non-Lambertian effects, where image formation can be modeled as the additive superposition of layers at diff...
Yanghai Tsin, Sing Bing Kang, Richard Szeliski
APPROX
2004
Springer
105views Algorithms» more  APPROX 2004»
15 years 7 months ago
Counting Connected Graphs and Hypergraphs via the Probabilistic Method
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwala...
WWW
2008
ACM
16 years 3 months ago
Behavioral classification on the click graph
A bipartite query-URL graph, where an edge indicates that a document was clicked for a query, is a useful construct for finding groups of related queries and URLs. Here we use thi...
Martin Szummer, Nick Craswell
PAKDD
2009
ACM
133views Data Mining» more  PAKDD 2009»
15 years 9 months ago
On Link Privacy in Randomizing Social Networks
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu