Sciweavers

402 search results - page 51 / 81
» On Finding the Number of Graph Automorphisms
Sort
View
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
13 years 9 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen
RIVF
2003
13 years 9 months ago
Airspace Sectorization By Constraint Programming
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
Huy Trandac, Philippe Baptiste, Vu Duong
CVPR
2007
IEEE
14 years 9 months ago
Scene Segmentation and Categorization Using NCuts
For video summarization and retrieval, one of the important modules is to group temporal-spatial coherent shots into high-level semantic video clips namely scene segmentation. In ...
Yanjun Zhao, Tao Wang, Peng Wang, Wei Hu, Yangzhou...
HICSS
2008
IEEE
199views Biometrics» more  HICSS 2008»
14 years 2 months ago
Clustering and the Biclique Partition Problem
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
Doina Bein, Linda Morales, Wolfgang W. Bein, C. O....
ASYNC
2001
IEEE
136views Hardware» more  ASYNC 2001»
13 years 11 months ago
Efficient Exact Two-Level Hazard-Free Logic Minimization
This paper presents a new approach to two-level hazardfree sum-of-products logic minimization. No currently available minimizers for single-output literal-exact two-level hazard-f...
Chris J. Myers, Hans M. Jacobson