Sciweavers

1511 search results - page 212 / 303
» Randomness, lowness and degrees
Sort
View
JPDC
2006
187views more  JPDC 2006»
15 years 6 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu
ENTCS
2007
89views more  ENTCS 2007»
15 years 6 months ago
Weak Probabilistic Anonymity
Abstract. Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can...
Yuxin Deng, Catuscia Palamidessi, Jun Pang
JSAC
2006
93views more  JSAC 2006»
15 years 6 months ago
Performance Enhancement of On-Board Communication Networks Using Outage Prediction
Abstract--A research area that has become increasingly important in recent years is that of on-board mobile communication, where users on a vehicle are connected to a local network...
Adeel Baig, Lavy Libman, Mahbub Hassan
IJBRA
2007
80views more  IJBRA 2007»
15 years 6 months ago
On predicting secondary structure transition
A function of a protein is dependent on its structure; therefore, predicting a protein structure from an amino acid sequence is an active area of research. Optimally predicting a ...
Raja Loganantharaj, Vivek Philip
SIGIR
2008
ACM
15 years 6 months ago
EigenRank: a ranking-oriented approach to collaborative filtering
A recommender system must be able to suggest items that are likely to be preferred by the user. In most systems, the degree of preference is represented by a rating score. Given a...
Nathan Nan Liu, Qiang Yang