Sciweavers

6409 search results - page 320 / 1282
» A Computational Algorithm for Origami Design
Sort
View
W2GIS
2004
Springer
16 years 2 hour ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
DAC
1998
ACM
15 years 11 months ago
Global Routing with Crosstalk Constraints
—Due to the scaling down of device geometry and increasing of frequency in deep submicron designs, crosstalk between interconnection wires has become an important issue in very l...
Hai Zhou, D. F. Wong
WWW
2007
ACM
16 years 7 months ago
Expertise networks in online communities: structure and algorithms
Web-based communities have become important places for people to seek and share expertise. We find that networks in these communities typically differ in their topology from other...
Jun Zhang, Mark S. Ackerman, Lada A. Adamic
COLT
2006
Springer
15 years 10 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
ECCV
2002
Springer
16 years 8 months ago
A Stochastic Algorithm for 3D Scene Segmentation and Reconstruction
In this paper, we present a stochastic algorithm by effective Markov chain Monte Carlo (MCMC) for segmenting and reconstructing 3D scenes. The objective is to segment a range image...
Feng Han, Zhuowen Tu, Song Chun Zhu