Sciweavers

819 search results - page 24 / 164
» Acknowledgements
Sort
View
APAL
2005
88views more  APAL 2005»
13 years 8 months ago
Dependence relations in computably rigid computable vector spaces
Abstract. We construct a computable vector space with the trivial computable automorphism group, but with the dependence relations as complicated as possible, measured by their Tur...
Rumen D. Dimitrov, Valentina S. Harizanov, Andrei ...
ICTIR
2009
Springer
13 years 6 months ago
Prior Information and the Determination of Event Spaces in Probabilistic Information Retrieval Models
Abstract. A mismatch between differenteventspaceshasbeen used toargue against rank equivalence of classic probabilistic models of information retrieval and language models. We ques...
Corrado Boscarino, Arjen P. de Vries
JPDC
2007
112views more  JPDC 2007»
13 years 8 months ago
CHEMAS: Identify suspect nodes in selective forwarding attacks
Selective forwarding attacks may corrupt some mission-critical applications such as military surveillance and forest fire monitoring in wireless sensor networks. In such attacks,...
Bin Xiao, Bo Yu, Chuanshan Gao
TON
2002
75views more  TON 2002»
13 years 8 months ago
Optimal retrial and timeout strategies for accessing network resources
The notion of timeout (namely, the maximal time to wait before retrying an action) turns up in many networking contexts, such as packet transmission, connection establishment, etc....
Lavy Libman, Ariel Orda

Publication
304views
15 years 7 months ago
A Binary Feedback Scheme for Congestion Avoidance in Computer Networks with Connectionless Network Layer
We propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses a minimal amount of feedback from the network to the ...
K. Ramakrishnan and R. Jain