Sciweavers

1689 search results - page 136 / 338
» Proximate point searching
Sort
View
CPAIOR
2008
Springer
15 years 7 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
ICDM
2009
IEEE
141views Data Mining» more  ICDM 2009»
16 years 7 days ago
Scalable Algorithms for Distribution Search
Distribution data naturally arise in countless domains, such as meteorology, biology, geology, industry and economics. However, relatively little attention has been paid to data m...
Yasuko Matsubara, Yasushi Sakurai, Masatoshi Yoshi...
162
Voted
CRYPTO
2005
Springer
106views Cryptology» more  CRYPTO 2005»
15 years 11 months ago
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
Omer Barkol, Yuval Ishai
BMCBI
2010
183views more  BMCBI 2010»
15 years 5 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
DCOSS
2011
Springer
14 years 5 months ago
STARS: Static relays for multi-robot real-time search and monitoring
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
Yuanteng Pei, Matt W. Mutka