Sciweavers

5263 search results - page 541 / 1053
» Open Constraint Optimization
Sort
View
TVCG
2011
136views more  TVCG 2011»
15 years 1 months ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
PPOPP
2009
ACM
16 years 7 months ago
Safe open-nested transactions through ownership
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha
ISCA
2009
IEEE
137views Hardware» more  ISCA 2009»
16 years 1 months ago
A case for an interleaving constrained shared-memory multi-processor
Shared-memory multi-threaded programming is inherently more difficult than single-threaded programming. The main source of complexity is that, the threads of an application can in...
Jie Yu, Satish Narayanasamy
INFOCOM
2005
IEEE
16 years 19 days ago
Buffer sizing for congested Internet links
— Packet buffers in router/switch interfaces constitute a central element of packet networks. The appropriate sizing of these buffers is an important and open research problem. M...
Amogh Dhamdhere, Hao Jiang, Constantinos Dovrolis
EUROPAR
2006
Springer
15 years 10 months ago
Multi-dimensional Kernel Generation for Loop Nest Software Pipelining
Single-dimension Software Pipelining (SSP) has been proposed as an effective software pipelining technique for multi-dimensional loops [16]. This paper introduces for the first tim...
Alban Douillet, Hongbo Rong, Guang R. Gao