Sciweavers

192 search results - page 20 / 39
» Cut Points in PEG
Sort
View
SGP
2007
15 years 1 days ago
Shape reconstruction from unorganized cross-sections
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications wher...
Jean-Daniel Boissonnat, Pooran Memari
CL
2008
Springer
14 years 9 months ago
Efficient exception handling in Java bytecode-to-C ahead-of-time compiler for embedded systems
One of the most promising approaches to Java acceleration in embedded systems is a bytecode-to-C ahead-of-time compiler (AOTC). It improves the performance of a Java virtual machi...
Dong-Heon Jung, Jong Kuk Park, Sung-Hwan Bae, Jaem...
BMCBI
2007
102views more  BMCBI 2007»
14 years 9 months ago
FlexOracle: predicting flexible hinges by identification of stable domains
Background: Protein motions play an essential role in catalysis and protein-ligand interactions, but are difficult to observe directly. A substantial fraction of protein motions i...
Samuel Flores, Mark Gerstein
ECCV
2004
Springer
15 years 11 months ago
Temporal Factorization vs. Spatial Factorization
The traditional subspace-based approaches to segmentation (often referred to as multi-body factorization approaches) provide spatial clustering/segmentation by grouping together po...
Lihi Zelnik-Manor, Michal Irani
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
15 years 10 months ago
Expander flows, geometric embeddings and graph partitioning
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
Sanjeev Arora, Satish Rao, Umesh V. Vazirani