Sciweavers

892 search results - page 177 / 179
» et 2007
Sort
View
DC
2007
13 years 8 months ago
On private computation in incomplete networks
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
Amos Beimel
DM
2007
97views more  DM 2007»
13 years 8 months ago
L(p, q) labeling of d-dimensional grids
In this paper, we address the problem of λ labelings, that was introduced in the context of frequency assignment for telecommunication networks. In this model, stations within a ...
Guillaume Fertin, André Raspaud
ECCC
2007
122views more  ECCC 2007»
13 years 8 months ago
Infeasibility of Instance Compression and Succinct PCPs for NP
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
Lance Fortnow, Rahul Santhanam
IIE
2007
75views more  IIE 2007»
13 years 8 months ago
Program and Evaluation Planning Light: Planning in the Real World
Although there are many high-quality models for program and evaluation planning, these models are often too intensive to be used in situations when time and resources are scarce. A...
Justus J. Randolph, Pasi J. Eronen
IJRR
2007
100views more  IJRR 2007»
13 years 8 months ago
Exactly Sparse Extended Information Filters for Feature-based SLAM
Recent research concerning the Gaussian canonical form for Simultaneous Localization and Mapping (SLAM) has given rise to a handful of algorithms that attempt to solve the SLAM sc...
Matthew Walter, Ryan Eustice, John J. Leonard