Sciweavers

475 search results - page 61 / 95
» Z3-Connectivity with Independent Number 2
Sort
View
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 10 months ago
Submodular Maximization by Simulated Annealing
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
Shayan Oveis Gharan, Jan Vondrák
ESEM
2007
ACM
14 years 1 months ago
An Empirical Study of the Effects of Gestalt Principles on Diagram Understandability
Comprehension errors in software design must be detected at their origin to avoid propagation into later portions of the software lifecycle and also the final system. This researc...
Krystle Lemon, Edward B. Allen, Jeffrey C. Carver,...
ALGORITHMICA
2005
93views more  ALGORITHMICA 2005»
13 years 10 months ago
Universal Asymptotics for Random Tries and PATRICIA Trees
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
Luc Devroye
TIT
2008
87views more  TIT 2008»
13 years 9 months ago
On Correcting Bursts (and Random Errors) in Vector Symbol (n, k) Cyclic Codes
Simple methods are shown for correcting bursts of large size and bursts combined with random errors using vector symbols and primarily vector XOR and feedback shift register operat...
John J. Metzner
CVPR
2008
IEEE
14 years 12 months ago
Classification using intersection kernel support vector machines is efficient
Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can ...
Subhransu Maji, Alexander C. Berg, Jitendra Malik