Sciweavers

413 search results - page 55 / 83
» Are Hopfield Networks Faster than Conventional Computers
Sort
View
NETGAMES
2006
ACM
15 years 12 months ago
Network game design: hints and implications of player interaction
While psychologists analyze network game-playing behavior in terms of players’ social interaction and experience, understanding user behavior is equally important to network res...
Kuan-Ta Chen, Chin-Laung Lei
SIGMOD
2010
ACM
267views Database» more  SIGMOD 2010»
15 years 10 months ago
Processing proximity relations in road networks
Applications ranging from location-based services to multi-player online gaming require continuous query support to monitor, track, and detect events of interest among sets of mov...
Zhengdao Xu, Hans-Arno Jacobsen
INFOCOM
2010
IEEE
15 years 4 months ago
Joint Energy Management and Resource Allocation in Rechargeable Sensor Networks
—Energy harvesting sensor platforms have opened up a new dimension to the design of network protocols. In order to sustain the network operation, the energy consumption rate cann...
Ren-Shiou Liu, Prasun Sinha, Can Emre Koksal
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
15 years 7 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
CIKM
2009
Springer
16 years 16 days ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...