Sciweavers

70 search results - page 8 / 14
» An exploration of ranking heuristics in mobile local search
Sort
View
UAI
2003
13 years 8 months ago
Systematic vs. Non-systematic Algorithms for Solving the MPE Task
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
Radu Marinescu 0002, Kalev Kask, Rina Dechter
ICDE
2008
IEEE
158views Database» more  ICDE 2008»
14 years 8 months ago
CARE: Finding Local Linear Correlations in High Dimensional Data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
Xiang Zhang, Feng Pan, Wei Wang
TEC
2002
163views more  TEC 2002»
13 years 7 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
RECSYS
2010
ACM
13 years 7 months ago
Global budgets for local recommendations
We present the design, implementation and evaluation of a new geotagging service, Gloe, that makes it easy to find, rate and recommend arbitrary on-line content in a mobile settin...
Thomas Sandholm, Hang Ung, Christina Aperjis, Bern...
EKAW
2010
Springer
13 years 6 months ago
Mobile Cultural Heritage Guide: Location-Aware Semantic Search
In this paper we explore the use of location aware mobile devices for searching and browsing a large number of general and cultural heritage information repositories. Based on GPS ...
Chris J. van Aart, Bob J. Wielinga, Willem Robert ...