320 search results - page 45 / 64 » A New Compression Method with Fast Searching on Large Databa... |
ICIP
2009
IEEE
13 years 6 months ago
2009
IEEE
Automating the process of postmortem identification of deceased individuals based on dental characteristics is receiving increased attention. With the large number of victims enco...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Modeling objects by probability density functions (pdf) is a new powerful method to represent complex objects in databases. By representing an object as a pdf, e.g. a Gaussian, it...
SIGMOD
2012
ACM
11 years 11 months ago
2012
ACM
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
WABI
2009
Springer
14 years 3 months ago
2009
Springer
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...