Sciweavers

1942 search results - page 376 / 389
» Speeding Up XTR
Sort
View
NETWORKING
2008
13 years 11 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Mohammad Behdadfar, Hossein Saidi
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
13 years 11 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
UAI
2008
13 years 11 months ago
Modelling local and global phenomena with sparse Gaussian processes
Much recent work has concerned sparse approximations to speed up the Gaussian process regression from the unfavorable O(n3 ) scaling in computational time to O(nm2 ). Thus far, wo...
Jarno Vanhatalo, Aki Vehtari
AAAI
2006
13 years 11 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
CSREAESA
2006
13 years 11 months ago
Design and Implementation of SoPC with Multi-Bus on a Chip
SoPC (System on a Programmable Chip) is one important kind of SoC solution based on PLD (Programmable Logic Device). At the same time, PBD (Platform-based Design) has become popul...
Fangjun Jian, Jizhong Han, Chengde Han, Qin Zhang,...