3192 search results - page 390 / 639 » The minimum latency problem |
142
click to vote
SNPD
2007
15 years 5 months ago
2007
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
188
click to vote
ACL
2006
15 years 5 months ago
2006
We present a new semi-supervised training procedure for conditional random fields (CRFs) that can be used to train sequence segmentors and labelers from a combination of labeled a...
140
click to vote
CATS
2006
15 years 5 months ago
2006
The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...
115
click to vote
FLAIRS
2004
15 years 5 months ago
2004
This paper presents multiDE, an extension of Price and Storn's differential evolution (DE) algorithm that consistently outperforms state-of-the-art search techniques for iden...
171
click to vote
WSS
2001
15 years 5 months ago
2001
Abstract. A data structure is stabilizing if, for any arbitrary (and possibly illegitimate) initial state, any sequence of sufficiently many operations brings the data structure to...