Sciweavers

11212 search results - page 508 / 2243
» Semi-persistent Data Structures
Sort
View
LREC
2010
184views Education» more  LREC 2010»
15 years 8 months ago
New Features in Spoken Language Search Hawk (SpLaSH): Query Language and Query Sequence
In this work we present further development of the SpLaSH (Spoken Language Search Hawk) project. SpLaSH implements a data model for annotated speech corpora integrated with textua...
Sara Romano, Francesco Cutugno
PDPTA
2007
15 years 8 months ago
Communication with Super Flexible Messaging
Abstract Super Flexible Messaging (SFM) provides a powerful and elegant message passing abstraction for transferring arbitrary data between remote processes. SFM achieves the simpl...
Alexey Fedosov, Gregory Benson
CIDR
2003
147views Algorithms» more  CIDR 2003»
15 years 8 months ago
Sorting And Indexing With Partitioned B-Trees
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
Goetz Graefe
ICDT
2011
ACM
213views Database» more  ICDT 2011»
14 years 10 months ago
On provenance and privacy
Provenance in scientific workflows is a double-edged sword. On the one hand, recording information about the module executions used to produce a data item, as well as the parame...
Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy, Ju...
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 9 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray