Sciweavers

2783 search results - page 540 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
CORR
2010
Springer
149views Education» more  CORR 2010»
14 years 9 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr
CORR
2010
Springer
133views Education» more  CORR 2010»
14 years 9 months ago
PSIM: A tool for analysis of device pairing methods
Wireless networks are a common place nowadays and almost all of the modern devices support wireless communication in some form. These networks differ from more traditional computi...
Yasir Arfat Malkani, Lachhman Das Dhomeja
CORR
2010
Springer
135views Education» more  CORR 2010»
14 years 9 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
CORR
2010
Springer
80views Education» more  CORR 2010»
14 years 9 months 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...
CORR
2010
Springer
122views Education» more  CORR 2010»
14 years 9 months ago
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
Deeparnab Chakrabarty, Chaitanya Swamy