Sciweavers

2192 search results - page 380 / 439
» Algorithms for Challenging Motif Problems
Sort
View
IROS
2009
IEEE
138views Robotics» more  IROS 2009»
14 years 2 months ago
Using eigenposes for lossless periodic human motion imitation
— Programming a humanoid robot to perform an action that takes the robot’s complex dynamics into account is a challenging problem. Traditional approaches typically require high...
Rawichote Chalodhorn, Rajesh P. N. Rao
CIKM
2009
Springer
14 years 2 months ago
P-Rank: a comprehensive structural similarity measure over information networks
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
Peixiang Zhao, Jiawei Han, Yizhou Sun
GEOS
2007
Springer
14 years 2 months ago
Modeling Spatio-temporal Network Computations: A Summary of Results
Spatio-temporal network is defined by a set of nodes, and a set of edges, where the properties of nodes and edges may vary over time. Such networks are encountered in a variety of...
Betsy George, Shashi Shekhar
VLDB
2004
ACM
120views Database» more  VLDB 2004»
14 years 1 months ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...
EDBT
2009
ACM
145views Database» more  EDBT 2009»
13 years 12 months ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...