Sciweavers

305 search results - page 16 / 61
» Vague Transformations in Information Retrieval
Sort
View
SPIRE
2009
Springer
14 years 2 months ago
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting
To compute Burrows-Wheeler Transform (BWT), one usually builds a suffix array (SA) first, and then obtains BWT using SA, which requires much redundant working space. In previous ...
Daisuke Okanohara, Kunihiko Sadakane
MM
2009
ACM
175views Multimedia» more  MM 2009»
14 years 20 days ago
Near-duplicate video matching with transformation recognition
Nowadays, the issue of near-duplicate video matching has been extensively studied. However, transformation, which is one of the major causes of near-duplicates, has been little di...
Zhipeng Wu, Shuqiang Jiang, Qingming Huang
ICPR
2006
IEEE
14 years 9 months ago
Bayesian Feedback in Data Clustering
In many clustering applications, the user has some vague notion of the number and membership of the desired clusters. However, it is difficult for the user to provide such knowled...
Anil K. Jain, Pavan Kumar Mallapragada, Martin H. ...
IADIS
2004
13 years 9 months ago
Query-Based Indexing in Collaorative Search
The success of Web search is often limited by a variety of factors. Typical queries are vague and imprecise. At the same time, the Web is a dynamic and unmoderated collection and ...
Jill Freyne, Barry Smyth
ACISICIS
2007
IEEE
14 years 2 months ago
Slicing Aided Design of Obfuscating Transforms
Abstract—An obfuscation aims to transform a program, without affecting its functionality, so that some secret information within the program can be hidden for as long as possible...
Stephen Drape, Anirban Majumdar, Clark D. Thombors...