Sciweavers

419 search results - page 31 / 84
» Improving Adaptable Similarity Query Processing by Using App...
Sort
View
196
Voted
ICDE
2006
IEEE
194views Database» more  ICDE 2006»
15 years 11 months ago
The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors
In applications of biometric databases the typical task is to identify individuals according to features which are not exactly known. Reasons for this inexactness are varying meas...
Alexey Pryakhin, Christian Böhm, Matthias Sch...
109
Voted
JUCS
2010
152views more  JUCS 2010»
14 years 4 months ago
Compositional Semantics of Dataflow Networks with Query-Driven Communication of Exact Values
: We develop and study the concept of dataflow process networks as used for example by Kahn to suit exact computation over data types related to real numbers, such as continuous fu...
Michal Konecný, Amin Farjudian
CIKM
2009
Springer
15 years 4 months ago
Inverted indexes vs. bitmap indexes in decision support systems
Bitmap indexes are widely used in Decision Support Systems (DSSs) to improve query performance. In this paper, we evaluate the use of compressed inverted indexes with adapted quer...
Truls A. Bjørklund, Nils Grimsmo, Johannes ...
ICASSP
2008
IEEE
15 years 4 months ago
Maximum conditional likelihood linear regression and maximum a posteriori for hidden conditional random fields speaker adaptatio
This paper shows how to improve Hidden Conditional Random Fields (HCRFs) for phone classification by applying various speaker adaptation techniques. These include Maximum A Poste...
Yun-Hsuan Sung, Constantinos Boulis, Daniel Jurafs...
76
Voted
BMCBI
2004
125views more  BMCBI 2004»
14 years 10 months ago
A fast algorithm for determining the best combination of local alignments to a query sequence
Background: Existing sequence alignment algorithms assume that similarities between DNA or amino acid sequences are linearly ordered. That is, stretches of similar nucleotides or ...
Gavin C. Conant, Andreas Wagner