Sciweavers

1172 search results - page 46 / 235
» Constructions of generalized Sidon sets
Sort
View
IJCV
1998
192views more  IJCV 1998»
14 years 11 months ago
What Is the Set of Images of an Object Under All Possible Illumination Conditions?
The appearance of an object depends on both the viewpoint from which it is observed and the light sources by which it is illuminated. If the appearance of two objects is never iden...
Peter N. Belhumeur, David J. Kriegman
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
14 years 11 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle
TYPES
1994
Springer
15 years 3 months ago
A Concrete Final Coalgebra Theorem for ZF Set Theory
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...
Lawrence C. Paulson
IDA
1997
Springer
15 years 4 months ago
How to Find Big-Oh in Your Data Set (and How Not to)
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...
Catherine C. McGeoch, Doina Precup, Paul R. Cohen
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 4 days ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim