Sciweavers

405 search results - page 34 / 81
» Detecting dominant locations from search queries
Sort
View
CVPR
2007
IEEE
16 years 8 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
PAMI
2011
15 years 1 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
IIS
2003
15 years 7 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
CIKM
2007
Springer
16 years 9 days ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
DEXA
2007
Springer
107views Database» more  DEXA 2007»
15 years 10 months ago
When Mobile Objects' Energy Is Not So Tight: A New Perspective on Scalability Issues of Continuous Spatial Query Systems
The two dominant costs in continuous spatial query systems are the wireless communication cost for location update, and the evaluation cost for query processing. Existing works add...
Tai T. Do, Fuyu Liu, Kien A. Hua