Sciweavers

648 search results - page 93 / 130
» A general dimension for query learning
Sort
View
COMPGEOM
2010
ACM
14 years 1 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
DATAMINE
1999
152views more  DATAMINE 1999»
13 years 8 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen
TMM
2008
167views more  TMM 2008»
13 years 8 months ago
Mining Appearance Models Directly From Compressed Video
In this paper, we propose an approach to learning appearance models of moving objects directly from compressed video. The appearance of a moving object changes dynamically in vide...
Datong Chen, Qiang Liu, Mingui Sun, Jie Yang
FCT
2009
Springer
14 years 3 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
WWW
2009
ACM
14 years 9 months ago
Web image retrieval reranking with multi-view clustering
General image retrieval is often carried out by a text-based search engine, such as Google Image Search. In this case, natural language queries are used as input to the search eng...
Mingmin Chi, Peiwu Zhang, Yingbin Zhao, Rui Feng, ...