Sciweavers

54 search results - page 9 / 11
» A Fully Dynamic Graph Algorithm for Recognizing Interval Gra...
Sort
View
ICRA
2009
IEEE
148views Robotics» more  ICRA 2009»
14 years 14 days ago
Graph-based robust shape matching for robotic application
— Shape is one of the useful information for object detection. The human visual system can often recognize objects based on the 2-D outline shape alone. In this paper, we address...
Hanbyul Joo, Yekeun Jeong, Olivier Duchenne, Seong...
FCCM
2002
IEEE
127views VLSI» more  FCCM 2002»
13 years 10 months ago
Hardware-Assisted Fast Routing
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
André DeHon, Randy Huang, John Wawrzynek
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 5 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn
BPM
2006
Springer
98views Business» more  BPM 2006»
13 years 9 months ago
Structured Service Composition
Composition languages like BPEL and many enactment tools only support structured process models, while most composition approaches only consider unstructured models. In this paper,...
Rik Eshuis, Paul W. P. J. Grefen, Sven Till
DEXA
2010
Springer
182views Database» more  DEXA 2010»
13 years 6 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...