Sciweavers

522 search results - page 52 / 105
» On the Hardness of the Noncommutative Determinant
Sort
View
PKDD
2010
Springer
150views Data Mining» more  PKDD 2010»
13 years 6 months ago
Virus Propagation on Time-Varying Networks: Theory and Immunization Algorithms
Given a contact network that changes over time (say, day vs night connectivity), and the SIS (susceptible/infected/susceptible, flu like) virus propagation model, what can we say ...
B. Aditya Prakash, Hanghang Tong, Nicholas Valler,...
ICDM
2010
IEEE
128views Data Mining» more  ICDM 2010»
13 years 6 months ago
User-Based Active Learning
Active learning has been proven a reliable strategy to reduce manual efforts in training data labeling. Such strategies incorporate the user as oracle: the classifier selects the m...
Christin Seifert, Michael Granitzer
OL
2011
242views Neural Networks» more  OL 2011»
13 years 2 months ago
On connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...
CICLING
2011
Springer
12 years 11 months ago
Ranking Multilingual Documents Using Minimal Language Dependent Resources
This paper proposes an approach of extracting simple and effective features that enhances multilingual document ranking (MLDR). There is limited prior research on capturing the co...
G. S. K. Santosh, N. Kiran Kumar, Vasudeva Varma
ICCV
2011
IEEE
12 years 8 months ago
Probabilistic Group-Level Motion Analysis and Scenario Recognition
This paper addresses the challenge of recognizing behavior of groups of individuals in unconstraint surveillance environments. As opposed to approaches that rely on agglomerative ...
Ming-Ching Chang, Nils Krahnstoever, Weina Ge