Sciweavers

1920 search results - page 170 / 384
» The Range Constraint: Algorithms and Implementation
Sort
View
IEEEPACT
2002
IEEE
15 years 9 months ago
Exploiting Pseudo-Schedules to Guide Data Dependence Graph Partitioning
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
Alex Aletà, Josep M. Codina, F. Jesú...
SENSYS
2006
ACM
15 years 10 months ago
StarDust: a flexible architecture for passive localization in wireless sensor networks
The problem of localization in wireless sensor networks where nodes do not use ranging hardware, remains a challenging problem, when considering the required location accuracy, en...
Radu Stoleru, Pascal Vicaire, Tian He, John A. Sta...
TPDS
2008
188views more  TPDS 2008»
15 years 4 months ago
Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks
We study efficient interference-aware joint routing and TDMA link scheduling for a multihop wireless network to maximize its throughput. Efficient link scheduling can greatly reduc...
Yu Wang 0003, Weizhao Wang, Xiang-Yang Li, Wen-Zha...
IPPS
2007
IEEE
15 years 10 months ago
Aggregate Threshold Queries in Sensor Networks
— An important class of queries over sensor networks are network-wide aggregation queries. In this work we study a class of aggregation queries which we refer to as aggregate thr...
Izchak Sharfman, Assaf Schuster, Daniel Keren
IVC
2006
227views more  IVC 2006»
15 years 4 months ago
Automatic registration of overlapping 3D point clouds using closest points
While the SoftAssign algorithm imposes a two-way constraint embedded into the deterministic annealing scheme and the EMICP algorithm imposes a one-way constraint, they represent t...
Yonghuai Liu