Sciweavers

1091 search results - page 57 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
14 years 2 months ago
Community Learning by Graph Approximation
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
Bo Long, Xiaoyun Xu, Zhongfei (Mark) Zhang, Philip...
ICIP
2001
IEEE
14 years 9 months ago
Robust estimation of depth and motion using stochastic approximation
The problemof structurefrom motion (SFM)is to extract the three-dimensionalmodel of a moving scene from a sequence of images. Though two images are sufficient to produce a 3D reco...
Rama Chellappa, Amit K. Roy Chowdhury
IROS
2007
IEEE
159views Robotics» more  IROS 2007»
14 years 2 months ago
Approximate covariance estimation in graphical approaches to SLAM
— Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...
Gian Diego Tipaldi, Giorgio Grisetti, Wolfram Burg...
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 8 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
VTC
2008
IEEE
179views Communications» more  VTC 2008»
14 years 2 months ago
Relay Subset Selection in Wireless Networks Using Partial Decode-and-Forward Transmission
This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Opt...
Caleb K. Lo, Sriram Vishwanath, Robert W. Heath Jr...