Sciweavers

692 search results - page 89 / 139
» BDD minimization for approximate computing
Sort
View
GLOBECOM
2009
IEEE
15 years 5 months ago
Design of Signal Constellation Rearrangement (CoRe) for Multiple Relay Links
Abstract – This paper considers a design of signal constellations for trans-modulation (constellation rearrangement: CoRe) in a relay system with the multiple links in which the ...
Jin Woo Kim, Hee S. Lee, Jae Yung Ahn, Chung Gu Ka...
ICNP
2009
IEEE
15 years 5 months ago
Attack-Tolerant Distributed Sensing for Dynamic Spectrum Access Networks
—Accurate sensing of the spectrum condition is of crucial importance to the mitigation of the spectrum scarcity problem in dynamic spectrum access (DSA) networks. Specifically, ...
Alexander W. Min, Kang G. Shin, Xin Hu
ICRA
2006
IEEE
111views Robotics» more  ICRA 2006»
15 years 5 months ago
Placement and Distributed Deployment of Sensor Teams for Triangulation based Localization
— We address the problem of placing a sensor network so as to minimize the uncertainty in estimating the position of targets. The novelty of our formulation is in the sensing mod...
Volkan Isler
82
Voted
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
15 years 4 months ago
Landmark Selection for Task-Oriented Navigation
—Many vision-based navigation systems are restricted to the use of only a limited number of landmarks when computing the camera pose. This limitation is due to the overhead of de...
Ronen Lerner, Ehud Rivlin, Ilan Shimshoni
74
Voted
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
15 years 4 months ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...