Sciweavers

439 search results - page 54 / 88
» Engineering Comparators for Graph Clusterings
Sort
View
AOSD
2007
ACM
13 years 12 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
ICPR
2006
IEEE
14 years 1 months ago
Audio Segmentation and Speaker Localization in Meeting Videos
Segmenting different individuals in a group meeting and their speech is an important first step for various tasks such as meeting transcription, automatic camera panning, multime...
Himanshu Vajaria, Tanmoy Islam, Sudeep Sarkar, Rav...
WWW
2007
ACM
14 years 8 months ago
U-REST: an unsupervised record extraction system
In this paper, we describe a system that can extract record structures from web pages with no direct human supervision. Records are commonly occurring HTML-embedded data tuples th...
Yuan Kui Shen, David R. Karger
CLUSTER
2007
IEEE
13 years 11 months ago
Efficient asynchronous memory copy operations on multi-core systems and I/OAT
Bulk memory copies incur large overheads such as CPU stalling (i.e., no overlap of computation with memory copy operation), small register-size data movement, cache pollution, etc...
Karthikeyan Vaidyanathan, Lei Chai, Wei Huang, Dha...
PDP
2006
IEEE
14 years 1 months ago
Parallel Adaptive Technique for Computing PageRank
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
Arnon Rungsawang, Bundit Manaskasemsak