Sciweavers

1051 search results - page 73 / 211
» Fundamental Challenges in Mobile Computing
Sort
View
JSSPP
2010
Springer
13 years 5 months ago
Hierarchical Scheduling of DAG Structured Computations on Manycore Processors with Dynamic Thread Grouping
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
Yinglong Xia, Viktor K. Prasanna, James Li
PARA
2000
Springer
13 years 11 months ago
Experiments in Separating Computational Algorithm from Program Distribution and Communication
Our proposal has the following key features: 1) The separation of a distributed program into a pure algorithm (PurAl) and a distribution/communication declaration (DUAL). This yie...
Raphael B. Yehezkael, Yair Wiseman, H. G. Mendelba...
MOBIHOC
2010
ACM
13 years 5 months ago
The intrusion detection in mobile sensor network
Intrusion detection is an important problem in sensor networks. Prior works in static sensor environments show that constructing sensor barriers with random sensor deployment can ...
Gabriel Yik Keung, Bo Li, Qian Zhang
SBBD
2004
119views Database» more  SBBD 2004»
13 years 9 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
LCN
2007
IEEE
14 years 2 months ago
Investigation of IEEE 802.11k-based Access Point Coverage Area and Neighbor Discovery
— Possessing knowledge about access point coverage areas and neighbors is of essential need for the provisioning of, e.g., location based handovers or push services. A convenient...
Sven D. Hermann, Marc Emmelmann, O. Belaifa, Adam ...