Sciweavers

238 search results - page 10 / 48
» Optimistic parallelism benefits from data partitioning
Sort
View
FOIKS
2010
Springer
13 years 5 months ago
Two Complementary Classification Methods for Designing a Concept Lattice from Interval Data
This paper holds on the application of two classification methods based on formal concept analysis (FCA) to interval data. The first method uses a similarity between objects while ...
Mehdi Kaytoue-Uberall, Zainab Assaghir, Nizar Mess...
TCSV
2002
148views more  TCSV 2002»
13 years 7 months ago
A full-featured, error-resilient, scalable wavelet video codec based on the set partitioning in hierarchical trees (SPIHT) algor
Compressed video bitstreams require protection from channel errors in a wireless channel. The threedimensional (3-D) SPIHT coder has proved its efficiency and its real-time capabi...
Sungdae Cho, William A. Pearlman
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
13 years 11 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
DATESO
2010
132views Database» more  DATESO 2010»
13 years 5 months ago
Two-step Modified SOM for Parallel Calculation
This paper presents a simple modification of classic Kohonen network (SOM), which allows parallel processing of input data vectors or partitioning the problem in case of insufficie...
Petr Gajdos, Pavel Moravec
LCPC
1994
Springer
13 years 11 months ago
Optimizing Array Distributions in Data-Parallel Programs
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...
Krishna Kunchithapadam, Barton P. Miller