Sciweavers

962 search results - page 147 / 193
» Same places, same things, same people
Sort
View
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
15 years 2 months ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...
CORR
2010
Springer
80views Education» more  CORR 2010»
13 years 8 months ago
High-Throughput Random Access via Codes on Graphs
—Recently, contention resolution diversity slotted ALOHA (CRDSA) has been introduced as a simple but effective improvement to slotted ALOHA. It relies on MAC burst repetitions an...
Gianluigi Liva, Enrico Paolini, Marco Chiani
ICRA
2010
IEEE
90views Robotics» more  ICRA 2010»
13 years 8 months ago
Robust robotic assembly through contingencies, plan repair and re-planning
Abstract— Enabling mobile robots to assemble large structures in constrained environments requires planning systems that are both capable of dealing with high complexity and can ...
Frederik W. Heger, Sanjiv Singh
KBSE
2010
IEEE
13 years 8 months ago
RESISTing reliability degradation through proactive reconfiguration
Situated software systems are an emerging class of systems that are predominantly pervasive, embedded, and mobile. They are marked with a high degree of unpredictability and dynam...
Deshan Cooray, Sam Malek, Roshanak Roshandel, Davi...
SIAMDM
2010
128views more  SIAMDM 2010»
13 years 8 months ago
Permutation Capacities of Families of Oriented Infinite Paths
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
Graham Brightwell, Gérard D. Cohen, Emanuel...