339 search results - page 18 / 68 » Handling dynamic data structures in search based testing |
DEXA
2010
Springer
13 years 7 months ago
2010
Springer
We researched to try to find a way to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by u...
PLDI
2010
ACM
14 years 2 months ago
2010
ACM
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
Uncertainty in categorical data is commonplace in many applications, including data cleaning, database integration, and biological annotation. In such domains, the correct value o...
NIPS
2004
13 years 10 months ago
2004
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
ECCV
2006
Springer
14 years 19 days ago
2006
Springer
Common problem encountered in the analysis of dynamic scene is the problem of simultaneous estimation of the number of models and their parameters. This problem becomes difficult a...