Sciweavers

158 search results - page 7 / 32
» Some counting problems related to permutation groups
Sort
View
ALT
2007
Springer
14 years 4 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava
PSIVT
2007
Springer
239views Multimedia» more  PSIVT 2007»
14 years 1 months ago
People Counting in Low Density Video Sequences
This paper presents a novel approach for automatic people counting in videos captured through a conventional closed-circuit television (CCTV) using computer vision techniques. The ...
Jaime Dalla Valle, Luiz E. Soares de Oliveira, Ale...
4OR
2010
107views more  4OR 2010»
13 years 7 months ago
On matrices with the Edmonds-Johnson property
s (from Seminario Dottorato's web page) 3 Notes of the seminars 9 Nicola Mazzari, A note on Grothendieck fundamental group . . . . . . . . . . . . . . 9 Marco Formentin, Infor...
Alberto Del Pia
RSA
2010
94views more  RSA 2010»
13 years 6 months ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder
CORR
2004
Springer
97views Education» more  CORR 2004»
13 years 7 months ago
Free quasi-symmetric functions, product actions and quantum field theory of partitions
Abstract. We investigate two associative products over the ring of symmetric functions related to the intransitive and Cartesian products of permutation groups. As an application, ...
Gérard Henry Edmond Duchamp, Jean-Gabriel L...