Sciweavers

1254 search results - page 165 / 251
» Making Hard Problems Harder
Sort
View
MOBICOM
2004
ACM
14 years 3 months ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
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 network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu
MOBIHOC
2004
ACM
14 years 3 months ago
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Mobile Ad Hoc Networks (MANETs) provide rapidly deployable and self-configuring network capacity required in many critical applications, e.g., battlefields, disaster relief and ...
Wenrui Zhao, Mostafa H. Ammar, Ellen W. Zegura
SIGCSE
2004
ACM
101views Education» more  SIGCSE 2004»
14 years 3 months ago
Effective features of algorithm visualizations
Many algorithm visualizations have been created, but little is known about which features are most important to their success. We believe that pedagogically useful visualizations ...
Purvi Saraiya, Clifford A. Shaffer, D. Scott McCri...
WPES
2004
ACM
14 years 3 months ago
Privacy preserving route planning
The number of location-aware mobile devices has been rising for several years. As this trend continues, these devices may be able to use their location information to provide inte...
Keith B. Frikken, Mikhail J. Atallah
MIR
2010
ACM
217views Multimedia» more  MIR 2010»
14 years 3 months ago
Feature selection for content-based, time-varying musical emotion regression
In developing automated systems to recognize the emotional content of music, we are faced with a problem spanning two disparate domains: the space of human emotions and the acoust...
Erik M. Schmidt, Douglas Turnbull, Youngmoo E. Kim