Sciweavers

1542 search results - page 219 / 309
» Kernelization of packing problems
Sort
View
SRDS
2006
IEEE
15 years 8 months ago
Satem: Trusted Service Code Execution across Transactions
Web services and service oriented architectures are becoming the de facto standard for Internet computing. A main problem faced by users of such services is how to ensure that the...
Gang Xu, Cristian Borcea, Liviu Iftode
PAKDD
2005
ACM
142views Data Mining» more  PAKDD 2005»
15 years 7 months ago
Dynamic Cluster Formation Using Level Set Methods
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...
Andy M. Yip, Chris H. Q. Ding, Tony F. Chan
ISCIS
2003
Springer
15 years 7 months ago
An Alternative Compressed Storage Format for Sparse Matrices
The handling of the sparse matrix vector product(SMVP) is a common kernel in many scientific applications. This kernel is an irregular problem, which has led to the development of...
Anand Ekambaram, Eurípides Montagne
ICCS
2001
Springer
15 years 6 months ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
Eun-Jin Im, Katherine A. Yelick
CVPR
2009
IEEE
15 years 5 months ago
"Who are you?" - Learning person specific classifiers from video
We investigate the problem of automatically labelling faces of characters in TV or movie material with their names, using only weak supervision from automaticallyaligned subtitle ...
Josef Sivic, Mark Everingham, Andrew Zisserman