Sciweavers

17329 search results - page 3079 / 3466
» Improved non-approximability results
Sort
View
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
16 years 1 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
16 years 1 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee
INEX
2007
Springer
16 years 1 months ago
Using and Detecting Links in Wikipedia
In this paper, we document our efforts at INEX 2007 where we participated in the Ad Hoc Track, the Link the Wiki Track, and the Interactive Track that continued from INEX 2006. Ou...
Khairun Nisa Fachry, Jaap Kamps, Marijn Koolen, Ju...
LCTRTS
2007
Springer
16 years 29 days ago
Tetris: a new register pressure control technique for VLIW processors
The run-time performance of VLIW (very long instruction word) microprocessors depends heavily on the effectiveness of its associated optimizing compiler. Typical VLIW compiler pha...
Weifeng Xu, Russell Tessier
MLDM
2007
Springer
16 years 29 days ago
Transductive Learning from Relational Data
Transduction is an inference mechanism “from particular to particular”. Its application to classification tasks implies the use of both labeled (training) data and unlabeled (...
Michelangelo Ceci, Annalisa Appice, Nicola Barile,...
« Prev « First page 3079 / 3466 Last » Next »