Sciweavers

2111 search results - page 93 / 423
» Understanding the Yarowsky Algorithm
Sort
View
CIKM
2010
Springer
14 years 7 months ago
Discovery of numerous specific topics via term co-occurrence analysis
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
Omid Madani, Jiye Yu
EUROSSC
2010
Springer
14 years 7 months ago
Identifying Important Action Primitives for High Level Activity Recognition
Smart homes have a user centered design that makes human activity as the most important type of context to adapt the environment according to people's needs. Sensor systems th...
Atif Manzoor, Claudia Villalonga, Alberto Calatron...
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
14 years 7 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...
ICRA
2010
IEEE
259views Robotics» more  ICRA 2010»
14 years 7 months ago
RANSAC matching: Simultaneous registration and segmentation
The iterative closest points (ICP) algorithm is widely used for ego-motion estimation in robotics, but subject to bias in the presence of outliers. We propose a random sample conse...
Shao-Wen Yang, Chieh-Chih Wang, Chun-Hua Chang
ISVC
2010
Springer
14 years 7 months ago
Indented Pixel Tree Plots
We introduce Indented Pixel Tree Plots (IPTPs): a novel pixel-based visualization technique for depicting large hierarchies. It is inspired by the visual metaphor of indented outli...
Michael Burch, Michael Raschke, Daniel Weiskopf