Sciweavers

2743 search results - page 46 / 549
» Minimization of an M-convex Function
Sort
View
SBBD
2008
256views Database» more  SBBD 2008»
13 years 10 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
CLEF
2010
Springer
13 years 10 months ago
DAEDALUS at WebPS-3 2010: k-Medoids Clustering Using a Cost Function Minimization
This paper describes the participation of DAEDALUS team at the WebPS-3 Task 1, regarding Web People Search. The focus of our research is to evaluate and compare the computational r...
Sara Lana-Serrano, Julio Villena-Román, Jos...
SIAMJO
2008
108views more  SIAMJO 2008»
13 years 9 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel
EUROCRYPT
2000
Springer
14 years 24 days ago
Minimal-Latency Secure Function Evaluation
Sander, Young and Yung recently exhibited a protocol for computing on encrypted inputs, for functions computable in NC1 . In their variant of secure function evaluation, Bob (the &...
Donald Beaver
DSD
2009
IEEE
71views Hardware» more  DSD 2009»
14 years 1 months ago
Representation of Incompletely Specified Index Generation Functions Using Minimal Number of Compound Variables
This paper shows a method to reduce the number of input variables to represent incompletely specified index generation functions. A compound variable is generated by EXORing the o...
Tsutomu Sasao, Takaaki Nakamura, Munehiro Matsuura