Sciweavers

1162 search results - page 218 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
TASLP
2011
13 years 2 months ago
A Probabilistic Interaction Model for Multipitch Tracking With Factorial Hidden Markov Models
—We present a simple and efficient feature modeling approach for tracking the pitch of two simultaneously active speakers. We model the spectrogram features of single speakers u...
Michael Wohlmayr, Michael Stark, Franz Pernkopf
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
14 years 8 months ago
Using retrieval measures to assess similarity in mining dynamic web clickstreams
While scalable data mining methods are expected to cope with massive Web data, coping with evolving trends in noisy data in a continuous fashion, and without any unnecessary stopp...
Olfa Nasraoui, Cesar Cardona, Carlos Rojas
PERCOM
2007
ACM
14 years 7 months ago
Sensor Scheduling for Optimal Observability Using Estimation Entropy
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
Mohammad Rezaeian
JSAC
2007
180views more  JSAC 2007»
13 years 7 months ago
Cooperative Distributed MIMO Channels in Wireless Sensor Networks
— The large number of network nodes and the energy constraints make Wireless Sensor Networks (WSN) one of the most important application fields for Cooperative Diversity. Node c...
Aitor del Coso, Umberto Spagnolini, Christian Ibar...
WWW
2008
ACM
14 years 8 months ago
Trust-based recommendation systems: an axiomatic approach
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...