Sciweavers

361 search results - page 64 / 73
» Average Case Analysis of Dynamic Geometric Optimization
Sort
View
ICCAD
2008
IEEE
153views Hardware» more  ICCAD 2008»
15 years 6 months ago
SPM management using Markov chain based data access prediction
— Leveraging the power of scratchpad memories (SPMs) available in most embedded systems today is crucial to extract maximum performance from application programs. While regular a...
Taylan Yemliha, Shekhar Srikantaiah, Mahmut T. Kan...
INFOCOM
2005
IEEE
15 years 3 months ago
On the interaction between overlay routing and underlay routing
— In this paper, we study the interaction between overlay routing and Traffic Engineering (TE) in a single Autonomous System (AS). We formulate this interaction as a twoplayer n...
Yong Liu, Honggang Zhang, Weibo Gong, Donald F. To...
TPDS
2008
120views more  TPDS 2008»
14 years 9 months ago
A New Storage Scheme for Approximate Location Queries in Object-Tracking Sensor Networks
Energy efficiency is one of the most critical issues in the design of wireless sensor networks. Observing that many sensor applications for object tracking can tolerate a certain d...
Jianliang Xu, Xueyan Tang, Wang-Chien Lee
PE
2010
Springer
170views Optimization» more  PE 2010»
14 years 8 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
79
Voted
CVPR
2001
IEEE
15 years 11 months ago
On Solving 2D and 3D Puzzles Using Curve Matching
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
Weixin Kong, Benjamin B. Kimia