Sciweavers

1972 search results - page 55 / 395
» connection 2008
Sort
View
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
14 years 9 months ago
On updates that constrain the features' connections during learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Jian Huang 0002
GLOBECOM
2008
IEEE
14 years 2 months ago
Time Dependent Message Spraying for Routing in Intermittently Connected Networks
—Intermittently connected mobile networks, also called Delay Tolerant Networks (DTNs), are wireless networks in which at any given time instance, the probability of having a comp...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski
ICPR
2008
IEEE
14 years 2 months ago
Face super-resolution using 8-connected Markov Random Fields with embedded prior
In patch based face super-resolution method, the patch size is usually very small, and neighbor patches’ relationship via overlapped regions is only to keep smoothness of recons...
Kai Guo, Xiaokang Yang, Rui Zhang, Guangtao Zhai, ...
IEEEIAS
2008
IEEE
14 years 2 months ago
A Model for the Study of Privacy Issues in Secure Shell Connections
: The Secure Shell (SSH) protocol strives to protect the privacy of its users in several ways. On one hand, the strong encryption and authentication algorithms that it adopts provi...
Maurizio Dusi, Francesco Gringoli, Luca Salgarelli
INFOCOM
2008
IEEE
14 years 2 months ago
Connectivity-Based Localization of Large Scale Sensor Networks with Complex Shape
—We study the problem of localizing a large sensor network having a complex shape, possibly with holes. A major challenge with respect to such networks is to figure out the corr...
Sol Lederer, Yue Wang, Jie Gao