Sciweavers

1768 search results - page 215 / 354
» Mining Very Large Databases
Sort
View
CIKM
2003
Springer
15 years 9 months ago
Multi-resolution disambiguation of term occurrences
We describe a system for extracting mentions of terms such as company and product names, in a large and noisy corpus of documents, such as the World Wide Web. Since natural langua...
Einat Amitay, Rani Nelken, Wayne Niblack, Ron Siva...
BPM
2008
Springer
142views Business» more  BPM 2008»
15 years 5 months ago
Crosscutting Concern Documentation by Visual Query of Business Processes
Business processes can be very large and may contain several different concerns, scattered across the process and tangled with other concerns. Crosscutting concerns are difficult t...
Chiara Di Francescomarino, Paolo Tonella
ICMLA
2008
15 years 5 months ago
Graph-Based Multilevel Dimensionality Reduction with Applications to Eigenfaces and Latent Semantic Indexing
Dimension reduction techniques have been successfully applied to face recognition and text information retrieval. The process can be time-consuming when the data set is large. Thi...
Sophia Sakellaridi, Haw-ren Fang, Yousef Saad
CDC
2009
IEEE
285views Control Systems» more  CDC 2009»
15 years 1 months ago
Adaptive randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
Alexander V. Nazin, Boris T. Polyak
IOR
2011
175views more  IOR 2011»
14 years 10 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....