Sciweavers

2487 search results - page 306 / 498
» Partitions of Graphs into Trees
Sort
View
CVPR
2000
IEEE
15 years 8 months ago
Perceptual Grouping and Segmentation by Stochastic Clustering
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
Yoram Gdalyahu, Noam Shental, Daphna Weinshall
IVC
2008
223views more  IVC 2008»
15 years 3 months ago
Euclidean path modeling for video surveillance
In this paper, we address the issue of Euclidean path modeling in a single camera for activity monitoring in a multi-camera video surveillance system. The method consists of a pat...
Imran N. Junejo, Hassan Foroosh
147
Voted
NETWORKS
2007
15 years 3 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
135
Voted
FOCS
2007
IEEE
15 years 10 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
164
Voted
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
15 years 9 months ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...