Sciweavers

1071 search results - page 33 / 215
» Programming with enumerable sets of structures
Sort
View
AIRS
2006
Springer
14 years 2 months ago
Natural Document Clustering by Clique Percolation in Random Graphs
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
Wei Gao, Kam-Fai Wong
PVLDB
2010
200views more  PVLDB 2010»
13 years 9 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
CVPR
2012
IEEE
12 years 1 months ago
Learning latent temporal structure for complex event detection
In this paper, we tackle the problem of understanding the temporal structure of complex events in highly varying videos obtained from the Internet. Towards this goal, we utilize a...
Kevin Tang, Fei-Fei Li, Daphne Koller
ENTCS
2007
124views more  ENTCS 2007»
13 years 11 months ago
Structuring Optimizing Transformations and Proving Them Sound
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
Aditya Kanade, Amitabha Sanyal, Uday P. Khedker
IPPS
2007
IEEE
14 years 5 months ago
Automatic Program Segment Similarity Detection in Targeted Program Performance Improvement
Targeted optimization of program segments can provide an additional program speedup over the highest default optimization level, such as -O3 in GCC. The key challenge is how to au...
Haiping Wu, Eunjung Park, Mihailo Kaplarevic, Ying...