Sciweavers

3922 search results - page 516 / 785
» Working Models for Uncertain Data
Sort
View
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
15 years 5 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin
ICRA
2008
IEEE
134views Robotics» more  ICRA 2008»
15 years 5 months ago
Real-time learning of resolved velocity control on a Mitsubishi PA-10
Abstract— Learning inverse kinematics has long been fascinating the robot learning community. While humans acquire this transformation to complicated tool spaces with ease, it is...
Jan Peters, Duy Nguyen-Tuong
101
Voted
IPPS
2008
IEEE
15 years 5 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
82
Voted
ICDE
2007
IEEE
135views Database» more  ICDE 2007»
15 years 5 months ago
Cost-Aware Skyline Queries in Structured Overlays
Recently, systems providing access to extremely large data collections, managed in a distributed manner, gain emerging attention. A promising approach to implement the physical la...
Marcel Karnstedt, Jessica Müller, Kai-Uwe Sat...
GLOBECOM
2006
IEEE
15 years 5 months ago
On the Optimal Scheduling for Media Streaming in Data-driven Overlay Networks
—The Internet has witnessed a rapid growth in deployment of data-driven overlay network (DON) based streaming applications during recent years. In these applications, each nodes ...
Meng Zhang, Yongqiang Xiong, Qian Zhang, Shiqiang ...