Sciweavers

329 search results - page 10 / 66
» On Range Searching with Semialgebraic Sets
Sort
View
ADL
2000
Springer
251views Digital Library» more  ADL 2000»
14 years 27 days ago
Efficient Similarity Search in Digital Libraries
Digital libraries are a core information technology. When the stored data is complex, e.g. high-resolution images or molecular protein structures, simple query types like the exac...
Christian Böhm, Bernhard Braunmüller, Ha...
DASFAA
2007
IEEE
153views Database» more  DASFAA 2007»
14 years 2 months ago
Interval-Focused Similarity Search in Time Series Databases
Similarity search in time series databases usually deals with comparing entire time series objects or subsequence search. In this paper, we formalize the notion of interval-focused...
Johannes Aßfalg, Hans-Peter Kriegel, Peer Kr...
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
14 years 8 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
AI
2003
Springer
14 years 1 months ago
Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
Dan C. Tulpan, Holger H. Hoos
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
14 years 2 months ago
Credit assignment in adaptive memetic algorithms
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
J. E. Smith