Sciweavers

2621 search results - page 18 / 525
» Near orders and codes
Sort
View
INFOCOM
2007
IEEE
14 years 2 months ago
Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks
Abstract— Data aggregation is a fundamental yet timeconsuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation...
Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Ying...
ECOOP
1997
Springer
14 years 18 days ago
Near Optimal Hierarchical Encoding of Types
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
Andreas Krall, Jan Vitek, R. Nigel Horspool
HCI
2009
13 years 6 months ago
Combining Electroencephalograph and Functional Near Infrared Spectroscopy to Explore Users' Mental Workload
We discuss the physiological metrics that can be measured with electroencephalography (EEG) and functional near infrared spectroscopy (fNIRs). We address the functional and practic...
Leanne M. Hirshfield, Krysta Chauncey, Rebecca Gul...
HPCA
2006
IEEE
14 years 8 months ago
CORD: cost-effective (and nearly overhead-free) order-recording and data race detection
Chip-multiprocessors are becoming the dominant vehicle for general-purpose processing, and parallel software will be needed to effectively utilize them. This parallel software is ...
Milos Prvulovic
ICC
2009
IEEE
190views Communications» more  ICC 2009»
14 years 3 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...