Sciweavers

1007 search results - page 158 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
IKE
2003
15 years 3 months ago
A Tree-Based inverted File for Fast Ranked-Document Retrieval
Inverted files are widely used to index documents in large-scale information retrieval systems. An inverted file consists of posting lists, which can be stored in either a documen...
Wann-Yun Shieh, Tien-Fu Chen, Chung-Ping Chung
ICDE
2010
IEEE
428views Database» more  ICDE 2010»
16 years 2 months ago
Supporting Top-K Keyword Search in XML Databases
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
Liang Jeff Chen, Yannis Papakonstantinou
ICASSP
2010
IEEE
15 years 2 months ago
Searching with expectations
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
Harsimrat Sandhawalia, Herve Jegou
ICCCN
2007
IEEE
15 years 8 months ago
A Fast Delivery Protocol for Total Order Broadcasting
Abstract—Sequencer, privilege-based, and communication history algorithms are popular approaches to implement total ordering, where communication history algorithms are most suit...
Li Ou, Xubin He, Christian Engelmann, Stephen L. S...
SPDP
1993
IEEE
15 years 6 months ago
Fault Tolerant Broadcasting in SIMD Hypercubes
- In this paper, we propose an optimal fault tolerant broadcasting algorithm which requires only n+1 steps for an SIMD hypercube with up to n-1 faulty nodes. The basic idea of the ...
Y. Chang