Sciweavers

4894 search results - page 857 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
ANCS
2008
ACM
13 years 10 months ago
Performing time-sensitive network experiments
Time-sensitive network experiments are difficult. There are major challenges involved in generating high volumes of sufficiently realistic traffic. Additionally, accurately measur...
Neda Beheshti, Yashar Ganjali, Monia Ghobadi, Nick...
ANNPR
2008
Springer
13 years 10 months ago
Patch Relational Neural Gas - Clustering of Huge Dissimilarity Datasets
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
Alexander Hasenfuss, Barbara Hammer, Fabrice Rossi
ASPDAC
2008
ACM
200views Hardware» more  ASPDAC 2008»
13 years 10 months ago
Non-Gaussian statistical timing analysis using second-order polynomial fitting
In the nanometer manufacturing region, process variation causes significant uncertainty for circuit performance verification. Statistical static timing analysis (SSTA) is thus dev...
Lerong Cheng, Jinjun Xiong, Lei He
ATAL
2008
Springer
13 years 10 months ago
Autonomous transfer for reinforcement learning
Recent work in transfer learning has succeeded in making reinforcement learning algorithms more efficient by incorporating knowledge from previous tasks. However, such methods typ...
Matthew E. Taylor, Gregory Kuhlmann, Peter Stone
CIKM
2008
Springer
13 years 10 months ago
Representative entry selection for profiling blogs
Many applications on blog search and mining often meet the challenge of handling huge volume of blog data, in which one single blog could contain hundreds or even thousands of ent...
Jinfeng Zhuang, Steven C. H. Hoi, Aixin Sun, Rong ...