Sciweavers

3244 search results - page 86 / 649
» On convex complexity measures
Sort
View
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
15 years 5 months ago
The round complexity of two-party random selection
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
Saurabh Sanghvi, Salil P. Vadhan
ESANN
2007
15 years 1 months ago
Controlling complexity of RBF networks by similarity
Abstract. Using radial basis function networks for function approximation tasks suffers from unavailable knowledge about an adequate network size. In this work, a measuring techni...
Ulrich Rückert, Ralf Eickhoff
115
Voted
WEBI
2005
Springer
15 years 5 months ago
Measuring the Relative Performance of Schema Matchers
Schema matching is a complex process focusing on matching between concepts describing the data in heterogeneous data sources. There is a shift from manual schema matching, done by...
Shlomo Berkovsky, Yaniv Eytani, Avigdor Gal
95
Voted
CVPR
2003
IEEE
16 years 1 months ago
Clustering Appearances of Objects Under Varying Illumination Conditions
We introduce two appearance-based methods for clustering a set of images of 3-D objects, acquired under varying illumination conditions, into disjoint subsets corresponding to ind...
Jeffrey Ho, Ming-Hsuan Yang, Jongwoo Lim, Kuang-Ch...
SIAMCO
2011
14 years 6 months ago
Nonlinear Black-Scholes Equations in Finance: Associated Control Problems and Properties of Solutions
We study properties of solutions to fully nonlinear versions of the standard Black– Scholes partial differential equation. These equations have been introduced in financial mat...
Rüdiger Frey, Ulrike Polte