Sciweavers

5595 search results - page 823 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ICFCA
2009
Springer
16 years 1 months ago
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
Radim Belohlávek, Vilém Vychodil
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
16 years 1 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
AVSS
2008
IEEE
16 years 1 months ago
Person Tracking with Audio-Visual Cues Using the Iterative Decoding Framework
Tracking humans in an indoor environment is an essential part of surveillance systems. Vision based and microphone array based trackers have been extensively researched in the pas...
Shankar T. Shivappa, Mohan M. Trivedi, Bhaskar D. ...
CEC
2008
IEEE
16 years 1 months ago
Improved Particle Swarm Optimization with low-discrepancy sequences
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
Millie Pant, Radha Thangaraj, Crina Grosan, Ajith ...
ICDCS
2006
IEEE
16 years 22 days ago
Self-Protection for Wireless Sensor Networks
Wireless sensor networks have recently been suggested for many surveillance applications such as object monitoring, path protection, or area coverage. Since the sensors themselves...
Dan Wang, Qian Zhang, Jiangchuan Liu