Sciweavers

2192 search results - page 282 / 439
» Algorithms for Challenging Motif Problems
Sort
View
146
Voted
INFOSCALE
2007
ACM
15 years 5 months ago
SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou
140
Voted
SDM
2010
SIAM
183views Data Mining» more  SDM 2010»
15 years 5 months ago
GraSS: Graph Structure Summarization
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
Kristen LeFevre, Evimaria Terzi
129
Voted
NIPS
2008
15 years 5 months ago
Beyond Novelty Detection: Incongruent Events, when General and Specific Classifiers Disagree
Unexpected stimuli are a challenge to any machine learning algorithm. Here we identify distinct types of unexpected events, focusing on 'incongruent events' when 'g...
Daphna Weinshall, Hynek Hermansky, Alon Zweig, Jie...
115
Voted
NIPS
2007
15 years 5 months ago
Hierarchical Apprenticeship Learning with Application to Quadruped Locomotion
We consider apprenticeship learning—learning from expert demonstrations—in the setting of large, complex domains. Past work in apprenticeship learning requires that the expert...
J. Zico Kolter, Pieter Abbeel, Andrew Y. Ng
136
Voted
CLEF
2010
Springer
15 years 4 months ago
DAEDALUS at WebPS-3 2010: k-Medoids Clustering Using a Cost Function Minimization
This paper describes the participation of DAEDALUS team at the WebPS-3 Task 1, regarding Web People Search. The focus of our research is to evaluate and compare the computational r...
Sara Lana-Serrano, Julio Villena-Román, Jos...