Sciweavers

1941 search results - page 218 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
DAC
1995
ACM
15 years 10 months ago
Hierarchical Optimization of Asynchronous Circuits
Abstract— Many asynchronous designs are naturally specified and implemented hierarchically as an interconnection of separate asynchronous modules that operate concurrently and c...
Bill Lin, Gjalt G. de Jong, Tilman Kolks
INFOCOM
2011
IEEE
14 years 10 months ago
iLight: Indoor device-free passive tracking using wireless sensor networks
—Target tracking is a main application of wireless sensor networks (WSNs), and has been studied widely [4], [10]. In this work, we study indoor passive tracking problem using WSN...
XuFei Mao, ShaoJie Tang, XiaoHua Xu, Xiang-Yang Li...
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
15 years 10 months ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler
TIT
2008
100views more  TIT 2008»
15 years 7 months ago
Communication Via Decentralized Processing
Abstract-- The common problem of a nomadic terminal sending information to a remote destination via agents with lossless connections is investigated. Such a setting suits, e.g. acc...
Amichai Sanderovich, Shlomo Shamai, Yossef Steinbe...
FOCS
2006
IEEE
16 years 1 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau