Sciweavers

9888 search results - page 1786 / 1978
» Active Algorithm Selection
Sort
View
CN
2006
85views more  CN 2006»
14 years 10 months ago
A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing
This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is ...
Simon Balon, Laurent Mélon, Guy Leduc
BMCBI
2007
145views more  BMCBI 2007»
14 years 10 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
IJCV
2008
192views more  IJCV 2008»
14 years 10 months ago
Learning to Locate Informative Features for Visual Identification
Object identification (OID) is specialized recognition where the category is known (e.g. cars) and the algorithm recognizes an object's exact identity (e.g. Bob's BMW). ...
Andras Ferencz, Erik G. Learned-Miller, Jitendra M...
CN
2007
141views more  CN 2007»
14 years 10 months ago
Identifying lossy links in wired/wireless networks by exploiting sparse characteristics
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
Hyuk Lim, Jennifer C. Hou
IJSNET
2006
107views more  IJSNET 2006»
14 years 10 months ago
In-network aggregation trade-offs for data collection in wireless sensor networks
This paper explores in-network aggregation as a power-efficient mechanism for collecting data in wireless sensor networks. In particular, we focus on sensor network scenarios wher...
Ignacio Solis, Katia Obraczka
« Prev « First page 1786 / 1978 Last » Next »