Sciweavers

5595 search results - page 358 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
PG
2007
IEEE
16 years 1 months ago
Developable Strip Approximation of Parametric Surfaces with Global Error Bounds
Developable surfaces have many desired properties in manufacturing process. Since most existing CAD systems utilize parametric surfaces as the design primitive, there is a great d...
Yong-Jin Liu, Yu-Kun Lai, Shi-Min Hu
WSC
2004
15 years 8 months ago
Approximate Time-Parallel Cache Simulation
In time-parallel simulation, the simulation time axis is decomposed into a number of slices which are assigned to parallel processes for concurrent simulation. Although a promisin...
Tobias Kiesling
ASPDAC
2010
ACM
119views Hardware» more  ASPDAC 2010»
15 years 4 months ago
VISA: versatile impulse structure approximation for time-domain linear macromodeling
Abstract-- We develop a rational function macromodeling algorithm named VISA (Versatile Impulse Structure Approximation) for macromodeling of system responses with (discrete) time-...
Chi-Un Lei, Ngai Wong
ICML
2001
IEEE
16 years 7 months ago
Constrained K-means Clustering with Background Knowledge
Clustering is traditionally viewed as an unsupervised method for data analysis. However, in some cases information about the problem domain is available in addition to the data in...
Kiri Wagstaff, Claire Cardie, Seth Rogers, Stefan ...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 7 months ago
Parameterizing pair approximations for takeover dynamics
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
Joshua L. Payne, Margaret J. Eppstein