Sciweavers

5595 search results - page 957 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CVPR
2010
IEEE
16 years 2 months ago
Automatic Image Annotation Using Group Sparsity
Automatically assigning relevant text keywords to images is an important problem. Many algorithms have been proposed in the past decade and achieved good performance. Efforts have...
Shaoting Zhang, Junzhou Huang, Yuchi Huang, Yang Y...
SEMWEB
2009
Springer
16 years 1 months ago
Parallel Materialization of the Finite RDFS Closure for Hundreds of Millions of Triples
In this paper, we consider the problem of materializing the complete finite RDFS closure in a scalable manner; this includes those parts of the RDFS closure that are often ignored...
Jesse Weaver, James A. Hendler
CCGRID
2007
IEEE
16 years 25 days ago
Study of Different Replica Placement and Maintenance Strategies in Data Grid
Data replication is an excellent technique to move and cache data close to users. By replication, data access performance can be improved dramatically. One of the challenges in da...
Rashedur M. Rahman, Ken Barker, Reda Alhajj
SSD
2007
Springer
131views Database» more  SSD 2007»
16 years 18 days ago
Efficiently Mining Regional Outliers in Spatial Data
With the increasing availability of spatial data in many applications, spatial clustering and outlier detection has received a lot of attention in the database and data mining comm...
Richard Frank, Wen Jin, Martin Ester
ISPDC
2005
IEEE
16 years 2 days ago
GMRES Method on Lightweight GRID System
Grid computing accomplishes high throughput computing by using a very large number of unexploited computing resources. We present a parallel method GMRES to solve large sparse lin...
Haiwu He, Guy Bergére, Serge G. Petiton