Sciweavers

1407 search results - page 217 / 282
» Join-Graph Propagation Algorithms
Sort
View
TSP
2008
101views more  TSP 2008»
13 years 8 months ago
Reduced-Complexity Soft MIMO Detection Based on Causal and Noncausal Decision Feedback
We present a reduced-complexity soft detection (RCSD) scheme geared to multiple-input multiple-output (MIMO) systems with spatial domain multiplexing leading to layered space-time ...
Yong Li, Jaekyun Moon
TSMC
1998
82views more  TSMC 1998»
13 years 8 months ago
To push or not to push: on the rearrangement of movable objects by a mobile robot
—We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several movable objects in its work space. We present an algor...
Ohad Ben-Shahar, Ehud Rivlin
SEUS
2010
IEEE
13 years 7 months ago
Reactive Clock Synchronization for Wireless Sensor Networks with Asynchronous Wakeup Scheduling
Most of the existing clock synchronization algorithms for wireless sensor networks can be viewed as proactive clock synchronization since they require nodes to periodically synchro...
Sang Hoon Lee, Yunmook Nah, Lynn Choi
SPIRE
2010
Springer
13 years 7 months ago
Fast Bit-Parallel Matching for Network and Regular Expressions
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 9 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...