Sciweavers

1184 search results - page 150 / 237
» Algorithmic Results in List Decoding
Sort
View
132
Voted
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
15 years 9 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
DEXA
2003
Springer
193views Database» more  DEXA 2003»
15 years 8 months ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
Christian Böhm, Florian Krebs
177
Voted

Publication
158views
17 years 1 months ago
Fair Flow Control for ATM-ABR Multipoint Connections
Multipoint-to-multipoint communication can be implemented by combining the point-to-multipoint and multipoint-to-point connection algorithms. In an ATM multipoint-to-point connecti...
Sonia Fahmy, Raj Jain, Rohit Goyal, and Bobby Vand...
ICML
1999
IEEE
16 years 4 months ago
Making Better Use of Global Discretization
Before applying learning algorithms to datasets, practitioners often globally discretize any numeric attributes. If the algorithm cannot handle numeric attributes directly, prior ...
Eibe Frank, Ian H. Witten
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 3 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang