Sciweavers

12193 search results - page 2387 / 2439
» It's not all about
Sort
View
DM
1998
91views more  DM 1998»
13 years 7 months ago
On some relations between 2-trees and tree metrics
A tree function (TF) t on a ÿnite set X is a real function on the set of the pairs of elements of X satisfying the four-point condition: for all distinct x; y; z; w ∈ X; t(xy)+...
Bruno Leclerc, Vladimir Makarenkov
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
13 years 7 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
JBCS
2002
116views more  JBCS 2002»
13 years 7 months ago
Software Components Retrieval Through Mediators and Web Search
Component Based Development (CBD) aims at constructing software through the integration, using interfaces and contracts, between pre-existing components. The main goal of this wor...
Robson P. de Souza, Marcelo N. Costa, Regina M. M....
DAM
1999
114views more  DAM 1999»
13 years 7 months ago
Perfect and Almost Perfect Sequences
The autocorrelation function of a sequence is a measure for how much the given sequence di ers from its translates. Periodic binary sequences with good correlation properties have...
Dieter Jungnickel, Alexander Pott
DATAMINE
1999
143views more  DATAMINE 1999»
13 years 7 months ago
Partitioning Nominal Attributes in Decision Trees
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
Don Coppersmith, Se June Hong, Jonathan R. M. Hosk...
« Prev « First page 2387 / 2439 Last » Next »