Sciweavers

5169 search results - page 632 / 1034
» Locality approximation using time
Sort
View
ESA
2008
Springer
111views Algorithms» more  ESA 2008»
15 years 8 months ago
Parallel Imaging Problem
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
Thành Nguyen, Éva Tardos
BDA
2007
15 years 8 months ago
PeerSum: Summary Management in P2P Systems
Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer suffi...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...
ANOR
2007
80views more  ANOR 2007»
15 years 7 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
219
Voted
COMCOM
2010
276views more  COMCOM 2010»
15 years 7 months ago
Adjustable convergecast tree protocol for wireless sensor networks
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
Tzung-Shi Chen, Hua-Wen Tsai, Chih-Ping Chu
189
Voted
CSDA
2006
84views more  CSDA 2006»
15 years 6 months ago
Three-mode partitioning
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...
Jan Schepers, Iven Van Mechelen, Eva Ceulemans