Sciweavers

650 search results - page 60 / 130
» Positive graphs
Sort
View
CORR
2011
Springer
138views Education» more  CORR 2011»
13 years 5 months ago
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudak...
ICPR
2006
IEEE
14 years 11 months ago
Finding Text in Natural Scenes by Figure-Ground Segmentation
Much past research on finding text in natural scenes uses bottom-up grouping processes to detect candidate text features as a first processing step. While such grouping procedures...
Huiying Shen, James Coughlan
COMCOM
2006
110views more  COMCOM 2006»
13 years 10 months ago
Localized routing with guaranteed delivery and a realistic physical layer in wireless sensor networks
Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where me...
Milos Stojmenovic, Amiya Nayak
CVPR
2010
IEEE
14 years 6 months ago
Disambiguating Visual Relations Using Loop Constraints
Repetitive and ambiguous visual structures in general pose a severe problem in many computer vision applications. Identification of incorrect geometric relations between images s...
Christopher Zach, Manfred Klopschitz, Marc Pollefe...
ICRA
2005
IEEE
150views Robotics» more  ICRA 2005»
14 years 3 months ago
Learning Sensor Network Topology through Monte Carlo Expectation Maximization
— We consider the problem of inferring sensor positions and a topological (i.e. qualitative) map of an environment given a set of cameras with non-overlapping fields of view. In...
Dimitri Marinakis, Gregory Dudek, David J. Fleet