Sciweavers

4171 search results - page 814 / 835
» Choice numbers of graphs
Sort
View
MM
2009
ACM
198views Multimedia» more  MM 2009»
15 years 2 months ago
Scalable detection of partial near-duplicate videos by visual-temporal consistency
Following the exponential growth of social media, there now exist huge repositories of videos online. Among the huge volumes of videos, there exist large numbers of near-duplicate...
Hung-Khoon Tan, Chong-Wah Ngo, Richang Hong, Tat-S...
ESOP
2001
Springer
15 years 2 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing
STACS
2001
Springer
15 years 2 months ago
A Toolkit for First Order Extensions of Monadic Games
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
David Janin, Jerzy Marcinkowski
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
15 years 2 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
SMA
1999
ACM
106views Solid Modeling» more  SMA 1999»
15 years 2 months ago
Resolving non-uniqueness in design feature histories
Nearly all major commercial computer-aided design systems have adopted a feature-based design approach to solid modeling. Models are created via a sequence of operations which app...
Vincent A. Cicirello, William C. Regli