Sciweavers

6740 search results - page 1019 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
SAC
2008
ACM
15 years 6 months ago
Mining fault-tolerant frequent patterns efficiently with powerful pruning
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
Jhih-Jie Zeng, Guanling Lee, Chung-Chi Lee
CIKM
2010
Springer
15 years 5 months ago
Understanding retweeting behaviors in social networks
Retweeting is an important action (behavior) on Twitter, indicating the behavior that users re-post microblogs of their friends. While much work has been conducted for mining text...
Zi Yang, Jingyi Guo, Keke Cai, Jie Tang, Juanzi Li...
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 5 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase
ICRA
2010
IEEE
138views Robotics» more  ICRA 2010»
15 years 5 months ago
Planning for autonomous door opening with a mobile manipulator
Abstract— Computing a motion that enables a mobile manipulator to open a door is challenging because it requires tight coordination between the motions of the arm and the base. H...
Sachin Chitta, Benjamin J. Cohen, Maxim Likhachev
ICST
2010
IEEE
15 years 5 months ago
Repairing GUI Test Suites Using a Genetic Algorithm
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
Si Huang, Myra B. Cohen, Atif M. Memon
« Prev « First page 1019 / 1348 Last » Next »