Sciweavers

1795 search results - page 240 / 359
» Search by strategy
Sort
View
GIS
2005
ACM
16 years 7 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
KDD
2006
ACM
121views Data Mining» more  KDD 2006»
16 years 7 months ago
Query-time entity resolution
The goal of entity resolution is to reconcile database references corresponding to the same real-world entities. Given the abundance of publicly available databases where entities...
Indrajit Bhattacharya, Lise Getoor, Louis Licamele
CHI
2010
ACM
16 years 1 months ago
NiCEBook: supporting natural note taking
In this paper, we present NiCEBook, a paper notebook that supports taking, structuring and reusing notes. Through a study of note-taking habits, we observed that different strateg...
Peter Brandl, Christoph Richter, Michael Haller
CEC
2009
IEEE
16 years 1 months ago
Theoretical analysis of rank-based mutation - combining exploration and exploitation
— Parameter setting is an important issue in the design of evolutionary algorithms. Recently, experimental work has pointed out that it is often not useful to work with a fixed ...
Pietro Simone Oliveto, Per Kristian Lehre, Frank N...
ICPR
2008
IEEE
16 years 1 months ago
Layered shape matching and registration: Stochastic sampling with hierarchical graph representation
To automatically register foreground target in cluttered images, we present a novel hierarchical graph representation and a stochastic computing strategy in Bayesian framework. Th...
Xiaobai Liu, Liang Lin, Hongwei Li, Hai Jin, Wenbi...