Sciweavers

5316 search results - page 289 / 1064
» Which Search Problems Are Random
Sort
View
SPAA
2005
ACM
15 years 10 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 7 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
LION
2007
Springer
139views Optimization» more  LION 2007»
15 years 11 months ago
Evolution of Fitness Functions to Improve Heuristic Performance
In this paper we introduce the variable fitness function which can be used to control the search direction of any search based optimisation heuristic where more than one objective ...
Stephen Remde, Peter I. Cowling, Keshav P. Dahal, ...
ICMCS
2007
IEEE
127views Multimedia» more  ICMCS 2007»
15 years 11 months ago
Robust Parking Space Detection Considering Inter-Space Correlation
A major problem in metropolitan areas is searching for parking spaces. In this paper, we propose a novel method for parking space detection. Given input video captured by a camera...
Qi Wu, Chingchun Huang, Shih-yu Wang, Wei-chen Chi...
ASIACRYPT
2003
Springer
15 years 10 months ago
Generalized Powering Functions and Their Application to Digital Signatures
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...
Hisayoshi Sato, Tsuyoshi Takagi, Satoru Tezuka, Ka...