361 search results - page 28 / 73 » Finding Optimal Pairs of Patterns |
110
click to vote
ASPLOS
2010
ACM
15 years 3 months ago
2010
ACM
We present an all-optical approach to constructing data networks on chip that combines the following key features: (1) Wavelengthbased routing, where the route followed by a packe...
141
Voted
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
111
Voted
KDD
2008
ACM
16 years 27 days ago
2008
ACM
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
100
Voted
IBPRIA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Piecewise-linear methods accomplish the registration by dividing the images in corresponding triangular patches, which are individually mapped through affine transformati...
117
Voted
AAAI
2010
14 years 9 months ago
2010
Dimensionality reduction plays an important role in many machine learning and pattern recognition tasks. In this paper, we present a novel dimensionality reduction algorithm calle...