Sciweavers

231 search results - page 41 / 47
» Two lower bounds for self-assemblies at temperature 1
Sort
View
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
15 years 9 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
COMGEO
2008
ACM
14 years 9 months ago
Optimal location of transportation devices
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
Jean Cardinal, Sébastien Collette, Ferran H...
POPL
2009
ACM
15 years 10 months ago
A cost semantics for self-adjusting computation
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
Ruy Ley-Wild, Umut A. Acar, Matthew Fluet
ISPD
2010
ACM
195views Hardware» more  ISPD 2010»
15 years 4 months ago
Density gradient minimization with coupling-constrained dummy fill for CMP control
In the nanometer IC design, dummy fill is often performed to improve layout pattern uniformity and the post-CMP quality. However, filling dummies might greatly increase intercon...
Huang-Yu Chen, Szu-Jui Chou, Yao-Wen Chang
INFOCOM
2003
IEEE
15 years 2 months ago
Exploring the trade-off between label size and stack depth in MPLS Routing
— Multiprotocol Label Switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineer...
Anupam Gupta, Amit Kumar, Rajeev Rastogi