Sciweavers

5802 search results - page 455 / 1161
» Parallelizing Feature Selection
Sort
View
IPPS
2005
IEEE
15 years 10 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
133
Voted
HPCC
2009
Springer
15 years 9 months ago
Evaluation of Coordinated Grid Scheduling Strategies
—Grid computing has emerged as a way to share geographically and organizationally distributed resources that may belong to different institutions or administrative domains. In th...
Ivan Rodero, Francesc Guim, Julita Corbalán
ICDCS
2012
IEEE
13 years 7 months ago
DARD: Distributed Adaptive Routing for Datacenter Networks
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...
Xin Wu, Xiaowei Yang
138
Voted
ICPR
2006
IEEE
16 years 6 months ago
A New Structural Constraint and its Application in Wide Baseline Matching
We introduce a new structural constraint that can be used for matching points in image pairs taken from a wide baseline. No assumption is made about the geometry of the 3?D points...
Roberto Manduchi, Xiaoye Lu
ALT
2006
Springer
16 years 2 months ago
Unsupervised Slow Subspace-Learning from Stationary Processes
Abstract. We propose a method of unsupervised learning from stationary, vector-valued processes. A low-dimensional subspace is selected on the basis of a criterion which rewards da...
Andreas Maurer