Sciweavers

625 search results - page 98 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 2 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
ICC
2007
IEEE
145views Communications» more  ICC 2007»
15 years 8 months ago
Predicting User-Perceived Quality Ratings from Streaming Media Data
Abstract—Media stream quality is highly dependent on underlying network conditions, but identifying scalable, unambiguous metrics to discern the user-perceived quality of a media...
Amy Csizmar Dalal, David R. Musicant, Jamie F. Ols...
JCNS
1998
134views more  JCNS 1998»
15 years 1 months ago
Analytical and Simulation Results for Stochastic Fitzhugh-Nagumo Neurons and Neural Networks
An analytical approach is presented for determining the response of a neuron or of the activity in a network of connected neurons, represented by systems of nonlinear ordinary stoc...
Henry C. Tuckwell, Roger Rodriguez
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 2 months ago
An Evidential Path Logic for Multi-Relational Networks
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
Marko A. Rodriguez, Joe Geldart
CISS
2008
IEEE
15 years 8 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...