Sciweavers

7200 search results - page 1082 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
195
Voted
ICCS
2004
Springer
16 years 7 days ago
Complex Network of Earthquakes
Complex Network of Earthquakes Sumiyoshi Abe Institute of Physics, University of Tsukuba Ibaraki 3058571, Japan First, a brief discussion is made about a relevance of nonextensive...
Sumiyoshi Abe, Norikazu Suzuki
182
Voted
IPSN
2004
Springer
16 years 7 days ago
Estimation from lossy sensor data: jump linear modeling and Kalman filtering
Due to constraints in cost, power, and communication, losses often arise in large sensor networks. The sensor can be modeled as an output of a linear stochastic system with random...
Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal
213
Voted
MOBICOM
2003
ACM
16 years 3 days ago
MiSer: an optimal low-energy transmission strategy for IEEE 802.11a/h
Reducing the energy consumption by wireless communication devices is perhaps the most important issue in the widely-deployed and exponentially-growing IEEE 802.11 Wireless LANs (W...
Daji Qiao, Sunghyun Choi, Amit Jain, Kang G. Shin
AGTIVE
2003
Springer
16 years 3 days ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman
167
Voted
ICALP
2003
Springer
16 years 2 days ago
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
« Prev « First page 1082 / 1440 Last » Next »