Sciweavers

727 search results - page 91 / 146
» One line and n points
Sort
View
PAMI
2007
148views more  PAMI 2007»
14 years 9 months ago
Infinitely Divisible Cascades to Model the Statistics of Natural Images
—We propose to model the statistics of natural images, thanks to the large class of stochastic processes called Infinitely Divisible Cascades (IDCs). IDCs were first introduced i...
Pierre Chainais
ICDM
2009
IEEE
126views Data Mining» more  ICDM 2009»
15 years 4 months ago
Convex Non-negative Matrix Factorization in the Wild
Abstract—Non-negative matrix factorization (NMF) has recently received a lot of attention in data mining, information retrieval, and computer vision. It factorizes a non-negative...
Christian Thurau, Kristian Kersting, Christian Bau...
COMPGEOM
1996
ACM
15 years 2 months ago
Flipping Edges in Triangulations
A triangulation of a point set Pn is a partitioning of the convex hull Conv(Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn...
Ferran Hurtado, Marc Noy, Jorge Urrutia
LATINCRYPT
2010
14 years 8 months ago
Generic Attacks on Misty Schemes
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
Valérie Nachef, Jacques Patarin, Joana Treg...
SPAA
2009
ACM
15 years 10 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman