Sciweavers

74
Voted
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 16 days ago
Human Speed-Accuracy Tradeoffs in Search
When foraging for information, users face a tradeoff between the accuracy and value of the acquired information and the time spent collecting it, a problem which also surfaces whe...
Christina Aperjis, Bernardo A. Huberman, Fang Wu
CORR
2010
Springer
100views Education» more  CORR 2010»
15 years 16 days ago
Shortest paths between shortest paths and independent sets
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
Marcin Kaminski, Paul Medvedev, Martin Milanic
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 16 days ago
Separations of Matroid Freeness Properties
Properties of Boolean functions on the hypercube that are invariant with respect to linear transformations of the domain are among some of the most well-studied properties in the ...
Arnab Bhattacharyya, Elena Grigorescu, Jakob Nords...
104
Voted
CORR
2010
Springer
174views Education» more  CORR 2010»
15 years 16 days ago
Collaborative Spectrum Sensing from Sparse Observations in Cognitive Radio Networks
Spectrum sensing, which aims at detecting spectrum holes, is the precondition for the implementation of cognitive radio. Collaborative spectrum sensing among the cognitive radio n...
Jia Meng, Wotao Yin, Husheng Li, Ekram Hossain, Zh...
CORR
2010
Springer
53views Education» more  CORR 2010»
15 years 16 days ago
Distributed solving through model splitting
Lars Kotthoff, Neil C. A. Moore
82
Voted
CORR
2010
Springer
70views Education» more  CORR 2010»
15 years 16 days ago
Structured sparsity-inducing norms through submodular functions
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
Francis Bach
CORR
2010
Springer
167views Education» more  CORR 2010»
15 years 16 days ago
Security Mitigations for Return-Oriented Programming Attacks
With the discovery of new exploit techniques, new protection mechanisms are needed as well. Mitigations like DEP (Data Execution Prevention) or ASLR (Address Space Layout Randomiz...
Piotr Bania
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 16 days ago
Hybrid tractability of soft constraint problems
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
Martin C. Cooper, Stanislav Zivný
69
Voted
CORR
2010
Springer
155views Education» more  CORR 2010»
15 years 16 days ago
Combinatorial Approximation Algorithms for MaxCut using Random Walks
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...
Satyen Kale, C. Seshadhri