Sciweavers

2570 search results - page 309 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
118
Voted
OSS
2009
Springer
15 years 10 months ago
Estimating Commit Sizes Efficiently
The quantitative analysis of software projects can provide insights that let us better understand open source and other software development projects. An important variable used in...
Philipp Hofmann, Dirk Riehle
124
Voted
ICPR
2008
IEEE
15 years 10 months ago
Kernel Bisecting k-means clustering for SVM training sample reduction
This paper presents a new algorithm named Kernel Bisecting k-means and Sample Removal (KBK-SR) as a sampling preprocessing for SVM training to improve the scalability. The novel c...
Xiao-Zhang Liu, Guo-Can Feng
123
Voted
ECCV
2004
Springer
15 years 9 months ago
Novelty Detection in Image Sequences with Dynamic Background
Abstract. We propose a new scheme for novelty detection in image sequences capable of handling non-stationary background scenarious, such as waving trees, rain and snow. Novelty de...
Fredrik Kahl, Richard I. Hartley, Volker Hilsenste...
133
Voted
ICDCS
1998
IEEE
15 years 7 months ago
Improved Lightpath (Wavelength) Routing in Large WDM Networks
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
Weifa Liang, George Havas, Xiaojun Shen
126
Voted
ICCAD
1993
IEEE
134views Hardware» more  ICCAD 1993»
15 years 7 months ago
Beyond the combinatorial limit in depth minimization for LUT-based FPGA designs
In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depth-optimal FlowMap algorithm. The new algorithm, na...
Jason Cong, Yuzheng Ding