Sciweavers

402 search results - page 15 / 81
» On Finding the Number of Graph Automorphisms
Sort
View
ISCIS
2004
Springer
14 years 1 months ago
Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...
Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Ak...
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 7 months ago
Approximation Algorithms for Treewidth
Abstract. This paper presents algorithms whose input is an undirected graph, and whose output is a tree decomposition of width that approximates the optimal, the treewidth of that ...
Eyal Amir
AMDO
2006
Springer
13 years 11 months ago
Finding Articulated Body in Time-Series Volume Data
This paper presents a new scheme for acquiring 3D kinematic structure and motion from time-series volume data, in particular, focusing on human body. Our basic strategy is to first...
Tomoyuki Mukasa, Shohei Nobuhara, Atsuto Maki, Tak...
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
14 years 9 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
COMBINATORICA
2008
87views more  COMBINATORICA 2008»
13 years 7 months ago
Quasi-randomness and the distribution of copies of a fixed graph
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...
Asaf Shapira