Sciweavers

699 search results - page 34 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
FOCS
1992
IEEE
15 years 1 months ago
Maximizing Non-Linear Concave Functions in Fixed Dimension
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
Sivan Toledo
DCC
2001
IEEE
15 years 9 months ago
Cryptography in Quadratic Function Fields
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...
Renate Scheidler

Lecture Notes
1973views
16 years 8 months ago
Advanced Microeconomics
These lecture notes cover several topics such as Optimization, Technology and profit maximization, Profit maximization and cost minimization, The cost function & duality, Consu...
Sten Nyberg
ICPR
2006
IEEE
15 years 10 months ago
A Convolution Edit Kernel for Error-tolerant Graph Matching
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
Horst Bunke, Michel Neuhaus
KAIS
2006
110views more  KAIS 2006»
14 years 9 months ago
Multi-step density-based clustering
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfei...