Sciweavers

868 search results - page 76 / 174
» A general compression algorithm that supports fast searching
Sort
View
WWW
2007
ACM
14 years 9 months ago
Netprobe: a fast and scalable system for fraud detection in online auction networks
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...
Shashank Pandit, Duen Horng Chau, Samuel Wang, Chr...
SIGDOC
2004
ACM
14 years 2 months ago
Semantic thumbnails: a novel method for summarizing document collections
The concept of thumbnails is common in image representation. A thumbnail is a highly compressed version of an image that provides a small, yet complete visual representation to th...
Arijit Sengupta, Mehmet M. Dalkilic, James C. Cost...
GROUP
2005
ACM
14 years 2 months ago
Searching for expertise in social networks: a simulation of potential strategies
People search for people with suitable expertise all of the time in their social networks – to answer questions or provide help. Recently, efforts have been made to augment this...
Jun Zhang, Mark S. Ackerman
CIKM
2005
Springer
14 years 2 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 10 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust