7015 search results - page 1056 / 1403 » Approximation algorithms for co-clustering |
217
click to vote
TSP
2008
15 years 6 months ago
2008
We study a sampling setup where a continuous-time signal is mapped by a memoryless, invertible and nonlinear transformation, and then sampled in a nonideal manner. Such scenarios a...
153
click to vote
VC
2008
15 years 6 months ago
2008
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...
179
click to vote
VC
2008
15 years 6 months ago
2008
It is difficult to render caustic patterns at interactive frame rates. This paper introduces new rendering techniques that relax current constraints, allowing scenes with moving, n...
201
click to vote
ASC
2004
15 years 6 months ago
2004
This paper proposes the applications of soft computing to deal with the constraints in conventional modelling techniques of the dynamic extrusion process. The proposed technique i...
195
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...