Sciweavers

1363 search results - page 139 / 273
» The road coloring problem
Sort
View
DAC
2009
ACM
16 years 1 months ago
Information hiding for trusted system design
For a computing system to be trusted, it is equally important to verify that the system performs no more and no less functionalities than desired. Traditional testing and verifica...
Junjun Gu, Gang Qu, Qiang Zhou
ALGOSENSORS
2008
Springer
15 years 8 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri
SIAMCOMP
2010
135views more  SIAMCOMP 2010»
15 years 1 months ago
Intractability of Clique-Width Parameterizations
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
IROS
2008
IEEE
238views Robotics» more  IROS 2008»
16 years 23 days ago
Shape-guided superpixel grouping for trail detection and tracking
Abstract— We describe a framework for detecting and tracking continuous ”trails” in images and image sequences for autonomous robot navigation. Continuous trails are extended...
Christopher Rasmussen, Donald Scott
WSC
2001
15 years 7 months ago
Using simulation to evaluate site traffic at an automobile truck plant
Recent trends in automotive manufacturing have increased the focus on the Just-In-Time (JIT) delivery of automotive components. By requiring smaller batches of parts delivered mor...
Joseph Hugan