Sciweavers

280 search results - page 9 / 56
» Using Determining Sets to Distinguish Kneser Graphs
Sort
View
ICDCS
1995
IEEE
13 years 11 months ago
Specifying Weak Sets
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...
Jeannette M. Wing, David C. Steere
ICMCS
1999
IEEE
135views Multimedia» more  ICMCS 1999»
13 years 11 months ago
Time-Constrained Keyframe Selection Technique
In accessing large collections of digitized videos, it is often difficult to find both the appropriate video file and the portion of the video that is of interest. This paper descr...
Andreas Girgensohn, John S. Boreczky
JAPLL
2008
101views more  JAPLL 2008»
13 years 7 months ago
Circle graphs and monadic second-order logic
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...
Bruno Courcelle
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 16 hour ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
ECCV
2008
Springer
14 years 9 months ago
Modeling and Recognition of Landmark Image Collections Using Iconic Scene Graphs
This paper presents an approach for modeling landmark sites such as the Statue of Liberty based on large-scale contaminated image collections gathered from the Internet. Our system...
Xiaowei Li, Changchang Wu, Christopher Zach, Svetl...