Sciweavers

900 search results - page 122 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
WSC
2008
13 years 11 months ago
Modeling and simulation of e-mail social networks: A new stochastic agent-based approach
Understanding how the structure of a network evolves over time is one of the most interesting and complex topics in the field of social networks. In our attempt to model the dynam...
Fabian Menges, Bud Mishra, Giuseppe Narzisi
MM
2010
ACM
170views Multimedia» more  MM 2010»
13 years 9 months ago
Training data collection system for a learning-based photographic aesthetic quality inference engine
We present a novel data collection system deployed for the ACQUINE - Aesthetic Quality Inference Engine. The goal of the system is to collect online user opinions, both structured...
Razvan Orendovici, James Ze Wang
MOBISYS
2009
ACM
14 years 9 months ago
A methodology for extracting temporal properties from sensor network data streams
The extraction of temporal characteristics from sensor data streams can reveal important properties about the sensed events. Knowledge of temporal characteristics in applications ...
Dimitrios Lymberopoulos, Athanasios Bamis, Andreas...
DKE
2006
125views more  DKE 2006»
13 years 8 months ago
Online clustering of parallel data streams
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
Jürgen Beringer, Eyke Hüllermeier
CIKM
2010
Springer
13 years 7 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...