Sciweavers

2600 search results - page 244 / 520
» Clustering with or without the Approximation
Sort
View
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
16 years 23 days ago
Separating Populations with Wide Data: A Spectral Analysis
In this paper, we consider the problem of partitioning a small data sample drawn from a mixture of k product distributions. We are interested in the case that individual features a...
Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuh...
CCGRID
2005
IEEE
16 years 7 days ago
Application-level simulation modelling of large grids
The simulation of large grids requires the generation of grid instances and an approximation of grid components’ behaviour. To generate grid instances, this paper outlines a set...
Serafeim Zanikolas, Rizos Sakellariou
JSSPP
2005
Springer
16 years 3 days ago
Scheduling Moldable BSP Tasks
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
Pierre-François Dutot, Marco Aurélio...
ICDM
2003
IEEE
225views Data Mining» more  ICDM 2003»
15 years 12 months ago
Combining the web content and usage mining to understand the visitor behavior in a web site
A web site is a semi structured collection of different kinds of data, whose motivation is show relevant information to visitor and by this way capture her/his attention. Understa...
Juan D. Velásquez, Hiroshi Yasuda, Terumasa...
VLSID
1993
IEEE
133views VLSI» more  VLSID 1993»
15 years 10 months ago
An Area-Efficient Systolic Architecture for Real-Time VLSI Finite Impulse Response Filters
An area-eficzent systolic architecture for realtime, programmable-coeBcient jinite impulse response (FIR)filters is presented. A technique called pipelined clustering is introduce...
V. Visvanathan, Nibedita Mohanty, S. Ramanathan