Sciweavers

6682 search results - page 383 / 1337
» network 2006
Sort
View
ORL
2006
103views more  ORL 2006»
15 years 6 months ago
Reduction tests for the prize-collecting Steiner problem
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
Eduardo Uchoa
KBS
2002
150views more  KBS 2002»
15 years 6 months ago
When eigenfaces are combined with wavelets
This paper presents a novel and interesting combination of wavelet techniques and eigenfaces to extract features for face recognition. Eigenfaces reduce the dimensions of face vec...
Li Bai, Yihui Liu
IJAR
2010
130views more  IJAR 2010»
15 years 5 months ago
Learning locally minimax optimal Bayesian networks
We consider the problem of learning Bayesian network models in a non-informative setting, where the only available information is a set of observational data, and no background kn...
Tomi Silander, Teemu Roos, Petri Myllymäki
CODES
2006
IEEE
16 years 27 days ago
TLM/network design space exploration for networked embedded systems
This paper presents a methodology to combine Transaction Level Modeling and System/Network co-simulation for the design of networked embedded systems. As a result, a new design di...
Nicola Bombieri, Franco Fummi, Davide Quaglia
CORR
2006
Springer
78views Education» more  CORR 2006»
15 years 6 months ago
Opti{c,m}al: Optical/Optimal Routing in Massively Dense Wireless Networks
Abstract-- We study routing for massively dense wireless networks, i.e., wireless networks that contain so many nodes that, in addition to their usual microscopic description, a no...
Roberto Catanuto, Stavros Toumpis, Giacomo Morabit...