Sciweavers

6142 search results - page 101 / 1229
» The Complexity of Partition Functions
Sort
View
JMLR
2006
108views more  JMLR 2006»
14 years 10 months ago
Learning Spectral Clustering, With Application To Speech Separation
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...
Francis R. Bach, Michael I. Jordan
TOG
2008
149views more  TOG 2008»
14 years 9 months ago
Randomized cuts for 3D mesh analysis
The goal of this paper is to investigate a new shape analysis method based on randomized cuts of 3D surface meshes. The general strategy is to generate a random set of mesh segmen...
Aleksey Golovinskiy, Thomas A. Funkhouser
HAIS
2009
Springer
14 years 7 months ago
A Three-Objective Evolutionary Approach to Generate Mamdani Fuzzy Rule-Based Systems
Abstract. In the last years, several papers have proposed to adopt multiobjective evolutionary algorithms (MOEAs) to generate Mamdani fuzzy rulebased systems with different trade-o...
Michela Antonelli, Pietro Ducange, Beatrice Lazzer...
VLSID
2002
IEEE
159views VLSI» more  VLSID 2002»
15 years 10 months ago
Challenges in the Design of a Scalable Data-Acquisition and Processing System-on-Silicon
Increasing complexity of the functionalities and the resultant growth in number of gates integrated in a chip coupled with shrinking geometries and short cycle time requirements br...
Karanth Shankaranarayana, Soujanna Sarkar, R. Venk...
CP
2005
Springer
15 years 3 months ago
Distributed Constraints for Large-Scale Scheduling Problems
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
Montserrat Abril, Miguel A. Salido, Federico Barbe...