Sciweavers

824 search results - page 163 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
CAD
2005
Springer
13 years 7 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
14 years 8 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
DAC
2008
ACM
13 years 9 months ago
Application mapping for chip multiprocessors
The problem attacked in this paper is one of automatically mapping an application onto a Network-on-Chip (NoC) based chip multiprocessor (CMP) architecture in a locality-aware fas...
Guangyu Chen, Feihui Li, Seung Woo Son, Mahmut T. ...
BMCBI
2006
120views more  BMCBI 2006»
13 years 7 months ago
Optimizing amino acid substitution matrices with a local alignment kernel
Background: Detecting remote homologies by direct comparison of protein sequences remains a challenging task. We had previously developed a similarity score between sequences, cal...
Hiroto Saigo, Jean-Philippe Vert, Tatsuya Akutsu

Publication
397views
14 years 9 months ago
Build it but where? A GIS methodology for guiding the planning of new cycling facilities
Concern over climate change, traffic congestion, and the health consequences of sedentary lifestyles has resulted in a surge of interest in cycling as an efficient form of urban ...
Larsen, J. & El-Geneidy, M.