Sciweavers

7015 search results - page 1168 / 1403
» Approximation algorithms for co-clustering
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
15 years 3 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
CIKM
2010
Springer
15 years 2 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
TCS
2010
15 years 2 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
CGF
2010
182views more  CGF 2010»
15 years 2 months ago
A Data-driven Segmentation for the Shoulder Complex
The human shoulder complex is perhaps the most complicated joint in the human body being comprised of a set of three bones, muscles, tendons, and ligaments. Despite this anatomica...
Q. Youn Hong, Sang Il Park, Jessica K. Hodgins
ICRA
2009
IEEE
218views Robotics» more  ICRA 2009»
15 years 1 months ago
Automatically and efficiently inferring the hierarchical structure of visual maps
In Simultaneous Localisation and Mapping (SLAM), it is well known that probabilistic filtering approaches which aim to estimate the robot and map state sequentially suffer from poo...
Margarita Chli, Andrew J. Davison
« Prev « First page 1168 / 1403 Last » Next »