Sciweavers

11160 search results - page 97 / 2232
» Incompleteness in a General Setting
Sort
View
SSDBM
2008
IEEE
114views Database» more  SSDBM 2008»
14 years 4 months ago
A General Framework for Increasing the Robustness of PCA-Based Correlation Clustering Algorithms
Abstract. Most correlation clustering algorithms rely on principal component analysis (PCA) as a correlation analysis tool. The correlation of each cluster is learned by applying P...
Hans-Peter Kriegel, Peer Kröger, Erich Schube...
PG
2007
IEEE
14 years 4 months ago
Papercraft Models using Generalized Cylinders
We introduce an algorithm for approximating a 2manifold 3D mesh by a set of developable surfaces. Each developable surface is a generalized cylinder represented as a strip of tria...
Fady Massarwi, Craig Gotsman, Gershon Elber
SSPR
2004
Springer
14 years 3 months ago
Learning from General Label Constraints
Most machine learning algorithms are designed either for supervised or for unsupervised learning, notably classification and clustering. Practical problems in bioinformatics and i...
Tijl De Bie, Johan A. K. Suykens, Bart De Moor
IPPS
1998
IEEE
14 years 2 months ago
A Generalized Framework for Global Communication Optimization
In distributed-memory message-passing architectures reducing communication cost is extremely important. In this paper, we present a technique to optimize communication globally. O...
Mahmut T. Kandemir, Prithviraj Banerjee, Alok N. C...
ICCAD
1996
IEEE
80views Hardware» more  ICCAD 1996»
14 years 2 months ago
Generalized constraint generation in the presence of non-deterministic parasitics
In a constraint-drivenlayout synthesisenvironment,parasitic constraints are generated and implemented in each phase of the design process to meet a given set of performance specif...
Edoardo Charbon, Paolo Miliozzi, Enrico Malavasi, ...