Sciweavers

4463 search results - page 727 / 893
» computing 2000
Sort
View
CP
2000
Springer
15 years 7 months ago
Random 3-SAT: The Plot Thickens
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
Cristian Coarfa, Demetrios D. Demopoulos, Alfonso ...
110
Voted
CPHYSICS
2007
138views more  CPHYSICS 2007»
15 years 2 months ago
UPIC: A framework for massively parallel particle-in-cell codes
The UCLA Parallel Particle-in-Cell (UPIC) Framework, is designed to provide trusted components for building a variety of parallel Particle-in-Cell (PIC) codes. It is based on the ...
Viktor K. Decyk
128
Voted
MVA
2000
212views Computer Vision» more  MVA 2000»
15 years 2 months ago
Edge-Based Segmentation of Textured Images Using Optimally Selected Gabor Filters
In this paper, we propose a technique for segmenting visual textures using features extracted from the reponses of Ga,bor filters, appropria.tely selectecl to be tuned to texture ...
Bertin Rodolphe Okombi-Diba, Juichi Miyamichi, Ken...
118
Voted
SIGKDD
2000
96views more  SIGKDD 2000»
15 years 2 months ago
Phenomenal Data Mining: From Data to Phenomena
Phenomenal data mining finds relations between the data and the phenomena that give rise to data rather than just relations among the data. For example, suppose supermarket cash r...
John McCarthy
ICPP
2000
IEEE
15 years 7 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary