Sciweavers

662 search results - page 31 / 133
» Cheap and Fast - But is it Good
Sort
View
PVLDB
2010
174views more  PVLDB 2010»
13 years 6 months ago
x-RDF-3X: Fast Querying, High Update Rates, and Consistency for RDF Databases
The RDF data model is gaining importance for applications in computational biology, knowledge sharing, and social communities. Recent work on RDF engines has focused on scalable p...
Thomas Neumann, Gerhard Weikum
TSP
2010
13 years 2 months ago
Fast algorithms for the computation of sliding sequency-ordered complex hadamard transform
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
Jiasong Wu, Huazhong Shu, Lu Wang, Lotfi Senhadji
TSP
2010
13 years 2 months ago
Multichannel fast QR-decomposition algorithms: weight extraction method and its applications
Abstract--Multichannel fast QR decomposition RLS (MCFQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The main limitation is...
Mobien Shoaib, Stefan Werner, José Antonio ...
ICASSP
2011
IEEE
12 years 11 months ago
Fast speaker diarization based on binary keys
Splitting a speech signal into speakers is the main goal of a speaker diarization system, which has become an important building block in many speech processing algorithms. Curren...
Xavier Anguera Miró, Jean-François B...
CN
2004
148views more  CN 2004»
13 years 7 months ago
Multiway range trees: scalable IP lookup with fast updates
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
Priyank Ramesh Warkhede, Subhash Suri, George Varg...