Sciweavers

1027 search results - page 166 / 206
» Comparing Search Algorithms for the Temperature Inversion Pr...
Sort
View
PCI
2005
Springer
14 years 2 months ago
Closest Pair Queries with Spatial Constraints
Abstract. Given two datasets DA and DB the closest-pair query (CPQ) retrieves the pair (a,b), where a ∈ DA and b ∈ DB, having the smallest distance between all pairs of objects...
Apostolos N. Papadopoulos, Alexandros Nanopoulos, ...
SIGIR
2004
ACM
14 years 2 months ago
Focused named entity recognition using machine learning
In this paper we study the problem of finding most topical named entities among all entities in a document, which we refer to as focused named entity recognition. We show that th...
Li Zhang, Yue Pan, Tong Zhang
WEBDB
2010
Springer
155views Database» more  WEBDB 2010»
14 years 2 months ago
Learning Topical Transition Probabilities in Click Through Data with Regression Models
The transition of search engine users’ intents has been studied for a long time. The knowledge of intent transition, once discovered, can yield a better understanding of how di...
Xiao Zhang, Prasenjit Mitra
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
14 years 24 days ago
Comparison of genetic representation schemes for scheduling soft real-time parallel applications
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
Yoginder S. Dandass, Amit C. Bugde
TKDE
2002
239views more  TKDE 2002»
13 years 8 months ago
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
Sungwon Jung, Sakti Pramanik