Sciweavers

1999 search results - page 34 / 400
» Finding Reductions Automatically
Sort
View
BMCBI
2006
100views more  BMCBI 2006»
14 years 9 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
TIT
2008
141views more  TIT 2008»
14 years 9 months ago
Dimensionality Reduction for Distributed Estimation in the Infinite Dimensional Regime
Distributed estimation of an unknown signal is a common task in sensor networks. The scenario usually envisioned consists of several nodes, each making an observation correlated wi...
Olivier Roy, Martin Vetterli
CONEXT
2010
ACM
14 years 7 months ago
MAWILab: combining diverse anomaly detectors for automated anomaly labeling and performance benchmarking
Evaluating anomaly detectors is a crucial task in traffic monitoring made particularly difficult due to the lack of ground truth. The goal of the present article is to assist rese...
Romain Fontugne, Pierre Borgnat, Patrice Abry, Ken...
CVPR
2008
IEEE
15 years 11 months ago
Margin-based discriminant dimensionality reduction for visual recognition
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...
Hakan Cevikalp, Bill Triggs, Frédéri...
SIAMJO
2010
100views more  SIAMJO 2010»
14 years 4 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz