Sciweavers

1403 search results - page 48 / 281
» Set cover algorithms for very large datasets
Sort
View
OPODIS
2007
14 years 8 days ago
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
Theodore P. Baker, Michele Cirinei
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
14 years 3 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
IBPRIA
2009
Springer
14 years 3 months ago
Large Scale Online Learning of Image Similarity through Ranking
ent abstract presents OASIS, an Online Algorithm for Scalable Image Similarity learning that learns a bilinear similarity measure over sparse representations. OASIS is an online du...
Gal Chechik, Varun Sharma, Uri Shalit, Samy Bengio
3DPVT
2006
IEEE
174views Visualization» more  3DPVT 2006»
14 years 4 months ago
Two Stage View Planning for Large-Scale Site Modeling
We present a systematic view planning method to assist construction of 3-D models of large outdoor sites using a mobile robot platform with mounted scanner. In the first stage, w...
Paul Blaer, Peter K. Allen
3DPVT
2004
IEEE
136views Visualization» more  3DPVT 2004»
14 years 2 months ago
Efficient Model Creation of Large Structures based on Range Segmentation
This paper describes an efficient 3D modeling method from 3D range data-sets that is utilizing range data segmentation. Our algorithm starts with a set of unregistered 3D range sc...
Ioannis Stamos, Marius Leordeanu