Sciweavers

1201 search results - page 157 / 241
» Linear Probing and Graphs
Sort
View
116
Voted
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 7 months ago
Detection of objects in noisy images and site percolation on square lattices
Abstract: We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algori...
Mikhail A. Langovoy, Olaf Wittich
103
Voted
DATE
2009
IEEE
189views Hardware» more  DATE 2009»
15 years 7 months ago
CUFFS: An instruction count based architectural framework for security of MPSoCs
—Multiprocessor System on Chip (MPSoC) architecture is rapidly gaining momentum for modern embedded devices. The vulnerabilities in software on MPSoCs are often exploited to caus...
Krutartha Patel, Sri Parameswaran, Roshan G. Ragel
141
Voted
IVC
2007
173views more  IVC 2007»
15 years 5 days ago
Outdoor recognition at a distance by fusing gait and face
We explore the possibility of using both face and gait in enhancing human recognition at a distance performance in outdoor conditions. Although the individual performance of gait ...
Zongyi Liu, Sudeep Sarkar
97
Voted
PODC
2009
ACM
16 years 1 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
COCOA
2007
Springer
15 years 6 months ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...