Sciweavers

553 search results - page 69 / 111
» On Planar Path Transformation
Sort
View
STACS
2010
Springer
15 years 6 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
KIVS
2011
Springer
14 years 2 months ago
A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
Hannes Frey, Ranjith Pillay
ICDCS
2010
IEEE
15 years 1 months ago
Minimizing Probing Cost and Achieving Identifiability in Network Link Monitoring
Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. I...
Qiang Zheng, Guohong Cao
ICCV
1995
IEEE
15 years 3 months ago
Recognition Using Region Correspondences
Recognition systems attempt to recover information about the identity of observed objects and their location in the environment. A fundamental problem in recognition is pose estima...
Ronen Basri, David W. Jacobs
ECCV
2006
Springer
16 years 1 months ago
Cyclostationary Processes on Shape Spaces for Gait-Based Recognition
Abstract. We present a geometric and statistical approach to gaitbased human recognition. The novelty here is to consider observations of gait, considered as planar silhouettes, to...
David Kaziska, Anuj Srivastava