45 search results - page 7 / 9 » Semidefinite Programs: New Search Directions, Smoothing-Type... |
COMPGEOM
2010
ACM
14 years 21 days ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
BMCBI
2004
13 years 7 months ago
2004
Background: A new sequence independent bioinformatics approach allowing genome-wide search for proteins with similar three dimensional structures has been developed. By utilizing ...
BIOINFORMATICS
2005
13 years 7 months ago
2005
BioLingua is an interactive, web-based programming environment that enables biologists to analyze biological systems by combining knowledge and data through direct end-user progra...
SAS
2009
Springer
14 years 8 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
CIVR
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we present a method to jointly optimise the relevance and the diversity of the results in image retrieval. Without considering diversity, image retrieval systems oft...