Results 1  10
of
239
Optimal Bounds on ThetaGraphs: More is not Always Better
"... We present tight upper and lower bounds on the spanning ratio of a large family of θgraphs. We show that θgraphs with 4k+2 cones (k ≥ 1 and integer) have a spanning ratio of 1 + 2 sin(θ/2), where θ is 2π/(4k + 2). We also show that θgraphs with 4k + 4 cones have spanning ratio at least 1 + 2 tan( ..."
Abstract
 Add to MetaCart
We present tight upper and lower bounds on the spanning ratio of a large family of θgraphs. We show that θgraphs with 4k+2 cones (k ≥ 1 and integer) have a spanning ratio of 1 + 2 sin(θ/2), where θ is 2π/(4k + 2). We also show that θgraphs with 4k + 4 cones have spanning ratio at least 1 + 2 tan
Tight error bounds for structured prediction
, 2014
"... Structured prediction tasks in machine learning involve the simultaneous prediction of multiple labels. This is typically done by maximizing a score function on the space of labels, which decomposes as a sum of pairwise elements, each depending on two specific labels. Intuitively, the more pairwise ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
terms are used, the better the expected accuracy. However, there is currently no theoretical account of this intuition. This paper takes a significant step in this direction. We formulate the problem as classifying the vertices of a known graph G = (V,E), where the vertices and edges of the graph
Toward Better Formula Lower Bounds: An Information Complexity Approach to the KRW Composition Conjecture
, 2013
"... One of the major open problems in complexity theory is proving superpolynomial lower bounds for circuits with logarithmic depth (i.e., P ̸ ⊆ NC1). This problem is interesting for two reasons: first, it is tightly related to understanding the power of parallel computation and of smallspace computat ..."
Abstract
 Add to MetaCart
One of the major open problems in complexity theory is proving superpolynomial lower bounds for circuits with logarithmic depth (i.e., P ̸ ⊆ NC1). This problem is interesting for two reasons: first, it is tightly related to understanding the power of parallel computation and of small
Efficient and Tight Upper Bounds for Haplotype Inference by Pure Parsimony using Delayed Haplotype Selection
"... Abstract. Haplotype inference from genotype data is a key step towards a better understanding of the role played by genetic variations on inherited diseases. One of the most promising approaches uses the pure parsimony criterion. This approach is called Haplotype Inference by Pure Parsimony (HIPP) a ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. Haplotype inference from genotype data is a key step towards a better understanding of the role played by genetic variations on inherited diseases. One of the most promising approaches uses the pure parsimony criterion. This approach is called Haplotype Inference by Pure Parsimony (HIPP
Towards optimal tdma scheduling for robotic swarm communication
 in Proceedings of the TAROS (Towards Autonomous Robotic Systems) intl. conference
, 2005
"... Initial results are presented on a new TDMA scheduling problem, which tries to minimise the duration of total information exchange throughout a multihop wireless network. A new network communication mode omnicast is introduced, which implements manytomany communication, and is similar to a concurr ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
concurrent multiple broadcast from every node to every other node. It can be shown that the lower bound for this problem for arbitrary connected networks with n nodes is n time steps, a general upper bound is n, and if the graph modelling the network is Hamiltonian. In fact, more recent results (see
likelihood and the role of models in molecular phylogenetics.
 Mol. Biol. Evol.
, 2000
"... Methods such as maximum parsimony (MP) are frequently criticized as being statistically unsound and not being based on any ''model.'' On the other hand, advocates of MP claim that maximum likelihood (ML) has some fundamental problems. Here, we explore the connection between the ..."
Abstract

Cited by 70 (11 self)
 Add to MetaCart
criterion, the search strategy over the space of trees, and assumptions about the model of evolution. It is useful to make a threeway division of the model of evolution. This consists of a tree T (or, more generally, a graph, when median networks or splits graphs are considered), a stochastic mechanism
1The Cramér–Rao Bound for Sparse Estimation
"... The goal of this paper is to characterize the best achievable performance for the problem of estimating an unknown parameter having a sparse representation. Specifically, we consider the setting in which a sparsely representable deterministic parameter vector is to be estimated from measurements cor ..."
Abstract
 Add to MetaCart
corrupted by Gaussian noise, and derive a lower bound on the meansquared error (MSE) achievable in this setting. To this end, an appropriate definition of bias in the sparse setting is developed, and the constrained Cramér–Rao bound (CRB) is obtained. This bound is shown to equal the CRB of an estimator
Cultural Biases in Economic Exchange",
, 2004
"... Abstract How much do cultural biases affect economic exchange? We try to answer this question by using the relative trust European citizens have for citizens of other countries. First, we document that this trust is affected not only by objective characteristics of the country being trusted, but al ..."
Abstract

Cited by 57 (4 self)
 Add to MetaCart
. For example, the average Canadian has more information about Americans than the average Japanese and this better information can significantly affect (upward or downward) her degree of trust. Hence, the second step in our procedure is to regress the residual trust on a series of variables that proxy
A STEP TOWARD CONSTANT TIME LOCAL SEARCH FOR OPTIMIZING PSEUDO BOOLEAN FUNCTIONS
, 2013
"... Pseudo Boolean Functions (PBFs) are the objective functions for a wide class of hard optimization problems, such as MAXSAT and MAXCUT. Since these problems are NPHard, researchers and practitioners rely on incomplete solvers, such as Stochastic Local Search (SLS), for large problems. BestImprove ..."
Abstract
 Add to MetaCart
Improvement Local Search (BILS) is a common form of SLS, which always takes the move yielding the highest improvement in the objective function. Generally, the more runtime SLS is given, the better solution can be obtained. This thesis aims at algorithmically accelerating SLS for PBFs using Walsh Analysis
Timing analysis for sensor network nodes of the atmega processor family
 In IEEE RTSS
, 2005
"... Lowend embedded architectures, such as sensor nodes, have become popular in diverse fields, many of which impose realtime constraints. Currently, the Atmel Atmega processor family used by Berkeley Motes lacks support for deriving safe bounds on the WCET, which is a prerequisite for performing real ..."
Abstract

Cited by 20 (11 self)
 Add to MetaCart
and variablecycle instructions, both handled more efficiently by our approach than by previous ones and results in up to 77 % improvement in bounding the WCET. The results demonstrate that our timing analysis framework is able to tightly and safely estimate the WCET of the benchmarks while simulator results
Results 1  10
of
239