Sciweavers

503 search results - page 58 / 101
» Two Algorithms for the Minimum Enclosing Ball Problem
Sort
View
ISPD
2012
ACM
283views Hardware» more  ISPD 2012»
14 years 2 months ago
Low-power gated bus synthesis for 3d ic via rectilinear shortest-path steiner graph
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
Chung-Kuan Cheng, Peng Du, Andrew B. Kahng, Shih-H...
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
GPC
2007
Springer
16 years 20 days ago
Optimizing Server Placement for QoS Requirements in Hierarchical Grid Environments
This paper focuses on two problems related to QoS-aware I/O server placement in hierarchical Grid environments. Given a hierarchical network with requests from clients, the network...
Chien-Min Wang, Chun-Chen Hsu, Pangfeng Liu, Hsi-M...
COMPGEOM
1994
ACM
15 years 10 months ago
Matching Shapes with a Reference Point
For two given point sets, we present a very simple (almost trivial) algorithm to translate one set so that the Hausdor distance between the two sets is not larger than a constant ...
Helmut Alt, Oswin Aichholzer, Günter Rote
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 6 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson