Sciweavers

1282 search results - page 253 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
MM
2004
ACM
192views Multimedia» more  MM 2004»
14 years 2 months ago
Communicating everyday experiences
In this paper, we present our approach to the problem of communicating everyday experiences. This is a challenging problem, since media from everyday events are unstructured, and ...
Preetha Appan, Hari Sundaram, David Birchfield
GRC
2010
IEEE
13 years 10 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
TIT
2008
141views more  TIT 2008»
13 years 8 months ago
Dimensionality Reduction for Distributed Estimation in the Infinite Dimensional Regime
Distributed estimation of an unknown signal is a common task in sensor networks. The scenario usually envisioned consists of several nodes, each making an observation correlated wi...
Olivier Roy, Martin Vetterli
ICDE
2007
IEEE
170views Database» more  ICDE 2007»
14 years 10 months ago
Tree-Pattern Similarity Estimation for Scalable Content-based Routing
With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important...
Raphaël Chand, Pascal Felber, Minos N. Garofa...
SIGMOD
2007
ACM
159views Database» more  SIGMOD 2007»
14 years 9 months ago
Boosting topic-based publish-subscribe systems with dynamic clustering
We consider in this paper a class of Publish-Subscribe (pub-sub) systems called topic-based systems, where users subscribe to topics and are notified on events that belong to thos...
Tova Milo, Tal Zur, Elad Verbin