Sciweavers

908 search results - page 130 / 182
» Temporal Analysis of Time Bounded Digital Systems
Sort
View
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
15 years 10 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
MOBIHOC
2006
ACM
15 years 9 months ago
Topology control meets SINR: : the scheduling complexity of arbitrary topologies
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...
COMPGEOM
2008
ACM
14 years 11 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
CORR
2010
Springer
140views Education» more  CORR 2010»
14 years 10 months ago
Dynamic Vehicle Routing for Data Gathering in Wireless Networks
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
Güner D. Çelik, Eytan Modiano
ISBI
2008
IEEE
15 years 10 months ago
An information-based clustering approach for fMRI activation detection
Most clustering algorithms in fMRI analysis implicitly require some nontrivial assumption on data structure. Due to arbitrary distribution of fMRI time series in the temporal doma...
Lijun Bai, Wei Qin, Jimin Liang, Jie Tian