Sciweavers

364 search results - page 27 / 73
» Computing Communities in Large Networks Using Random Walks
Sort
View
WIOPT
2005
IEEE
15 years 8 months ago
Optimal Controlled Flooding Search in a Large Wireless Network
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flo...
Nicholas B. Chang, Mingyan Liu
123
Voted
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
16 years 3 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
GRC
2010
IEEE
15 years 2 months ago
Geo-clustering of Images with Missing GeoTags
—Images with GPS coordinates are a rich source of information about a geographic location. Innovative user services and applications are being built using geotagged images taken ...
Vishwakarma Singh, Sharath Venkatesha, Ambuj K. Si...
142
Voted
EUROPAR
2004
Springer
15 years 8 months ago
Large-Scale Deployment in P2P Experiments Using the JXTA Distributed Framework
The interesting properties of P2P systems (high availability despite peer volatility, support for heterogeneous architectures, high scalability, etc.) make them attractive for dist...
Gabriel Antoniu, Luc Bougé, Mathieu Jan, S&...
ESANN
2008
15 years 4 months ago
Pruning and Regularisation in Reservoir Computing: a First Insight
Reservoir Computing is a new paradigm for using Recurrent Neural Networks which shows promising results. However, as the recurrent part is created randomly, it typically needs to b...
Xavier Dutoit, Benjamin Schrauwen, Jan M. Van Camp...