Sciweavers

1696 search results - page 137 / 340
» Permuted function matching
Sort
View
84
Voted
STACS
2009
Springer
15 years 5 months ago
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
Kenya Ueno
FLOPS
2008
Springer
15 years 14 days ago
Termination of Narrowing in Left-Linear Constructor Systems
Narrowing extends rewriting with logic capabilities by allowing free variables in terms and replacing matching with unification. Narrowing has been widely used in different context...
Germán Vidal
80
Voted
FOCS
2008
IEEE
15 years 5 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer
102
Voted
IJCV
2002
129views more  IJCV 2002»
14 years 10 months ago
A Hierarchical Symmetric Stereo Algorithm Using Dynamic Programming
In this paper, a new hierarchical stereo algorithm is presented. The algorithm matches individual pixels in corresponding scanlines by minimizing a cost function. Several cost fun...
G. Van Meerbergen, Maarten Vergauwen, Marc Pollefe...
TOG
2012
184views Communications» more  TOG 2012»
13 years 1 months ago
Point sampling with general noise spectrum
Point samples with different spectral noise properties (often defined using color names such as white, blue, green, and red) are important for many science and engineering discip...
Yahan Zhou, Haibin Huang, Li-Yi Wei, Rui Wang