Sciweavers

702 search results - page 32 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
TASE
2010
IEEE
14 years 6 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
16 years 5 days ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
ICIP
2001
IEEE
16 years 1 months ago
Video similarity detection with video signature clustering
The proliferation of video content on the web makes similarity detection an indispensable tool in web data management, searching, and navigation. We have previously proposed a com...
Sen-Ching S. Cheung, Avideh Zakhor
OOPSLA
2000
Springer
15 years 3 months ago
Scalable propagation-based call graph construction algorithms
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
Frank Tip, Jens Palsberg
SMI
2008
IEEE
181views Image Analysis» more  SMI 2008»
15 years 6 months ago
Example based skeletonization using harmonic one-forms
This paper presents a method to extract skeletons using examples. Our method is based on the observation that many deformations in real world applications are isometric or near is...
Ying He 0001, Xian Xiao, Hock Soon Seah