Sciweavers

66 search results - page 7 / 14
» Generating exact D-optimal designs for polynomial models
Sort
View
ASIACRYPT
2009
Springer
15 years 4 months ago
Secure Multi-party Computation Minimizing Online Rounds
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
Seung Geol Choi, Ariel Elbaz, Tal Malkin, Moti Yun...
ISQED
2006
IEEE
142views Hardware» more  ISQED 2006»
15 years 3 months ago
Constructing Current-Based Gate Models Based on Existing Timing Library
Current-based gate modeling achieves a new level of accuracy in nanoscale design timing and signal integrity analysis. However, to generate current-based gate models requires addi...
Andrew B. Kahng, Bao Liu, Xu Xu
ASPDAC
2001
ACM
105views Hardware» more  ASPDAC 2001»
15 years 1 months ago
Toward better wireload models in the presence of obstacles
Wirelength estimation techniques typically contain a site density function that enumerates all possible path sites for each wirelength in an architecture and an occupation probabil...
Chung-Kuan Cheng, Andrew B. Kahng, Bao Liu, Dirk S...
WWW
2005
ACM
15 years 10 months ago
On optimal service selection
While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet b...
Piero A. Bonatti, P. Festa
STACS
2007
Springer
15 years 3 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...