Sciweavers

96 search results - page 3 / 20
» Structure and linear time recognition of 3-leaf powers
Sort
View
INFOCOM
2008
IEEE
15 years 3 months ago
End-to-End Resource Allocation in OFDM Based Linear Multi-Hop Networks
— We study the end-to-end resource allocation in an OFDM based multi-hop network consisting of a one-dimensional chain of nodes including a source, a destination, and multiple re...
Xiaolu Zhang, Wenhua Jiao, Meixia Tao
COCOA
2008
Springer
14 years 11 months ago
Simplicial Powers of Graphs
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
Andreas Brandstädt, Van Bang Le
ICCV
2001
IEEE
15 years 11 months ago
Real-Time Tracking of Highly Articulated Structures in the Presence of Noisy Measurements
This paper presents a novel approach for model-based realtime tracking of highly articulated structures such as humans. This approach is based on an algorithm which efficiently pr...
Tom Drummond, Roberto Cipolla
COMPGEOM
2006
ACM
15 years 3 months ago
Vines and vineyards by updating persistence in linear time
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...
JMLR
2008
148views more  JMLR 2008»
14 years 9 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov