Sciweavers

1845 search results - page 369 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
CVPR
2011
IEEE
12 years 8 months ago
Internal Statistics of a Single Natural Image
Statistics of ‘natural images’ provides useful priors for solving under-constrained problems in Computer Vision. Such statistics is usually obtained from large collections of ...
Maria Zontak, Michal Irani
ICALP
2011
Springer
12 years 8 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 5 months ago
Gowers uniformity, influence of variables, and PCPs
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
Alex Samorodnitsky, Luca Trevisan
SIGIR
2012
ACM
11 years 7 months ago
TwiNER: named entity recognition in targeted twitter stream
Many private and/or public organizations have been reported to create and monitor targeted Twitter streams to collect and understand users’ opinions about the organizations. Tar...
Chenliang Li, Jianshu Weng, Qi He, Yuxia Yao, Anwi...
FCT
2009
Springer
13 years 11 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad