Sciweavers

282 search results - page 16 / 57
» Efficient bundle sorting
Sort
View
TOIS
2002
97views more  TOIS 2002»
13 years 7 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
ICDE
2006
IEEE
150views Database» more  ICDE 2006»
14 years 8 months ago
Efficient Aggregation of Ranked Inputs
A top-k query combines different rankings of the same set of objects and returns the k objects with the highest combined score according to an aggregate function. We bring to ligh...
Nikos Mamoulis, Kit Hung Cheng, Man Lung Yiu, Davi...
IPPS
1998
IEEE
13 years 11 months ago
Broadcast-Efficient Algorithms on the Coarse-Grain Broadcast Communication Model with Few Channels
The main contribution of this work is to present elegant broadcast-efficientalgorithms for permutation routing, ranking, and sorting n items on the Broadcast Communication Model (...
Koji Nakano, Stephan Olariu, James L. Schwing
DCC
2005
IEEE
14 years 7 months ago
Efficient String Matching Algorithms for Combinatorial Universal Denoising
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
S. Chen, Suhas N. Diggavi, Sanket Dusad, S. Muthuk...
ACCV
2010
Springer
13 years 2 months ago
Efficient Structured Support Vector Regression
Support Vector Regression (SVR) has been a long standing problem in machine learning, and gains its popularity on various computer vision tasks. In this paper, we propose a structu...
Ke Jia, Lei Wang, Nianjun Liu