Sciweavers

431 search results - page 21 / 87
» Majoritarian Group Actions
Sort
View
53
Voted
MLQ
2007
83views more  MLQ 2007»
14 years 9 months ago
Computing the complexity of the relation of isometry between separable Banach spaces
We compute here the Borel complexity of the relation of isometry between separable Banach spaces, using results of Gao, Kechris [1] and Mayer-Wolf [4]. We show that this relation ...
Julien Melleray

Book
410views
16 years 7 months ago
Action Arcade Adventure Set
"Have you ever played a side-scrolling action arcade game on your PC and wondered what it takes to program one? How do the programmers scroll their backgrounds so fast and mak...
Diana Gruber
197
Voted
GRAPHICSINTERFACE
2011
14 years 1 months ago
Formation sketching: an approach to stylize groups in crowd simulation
Most of existing crowd simulation algorithms focus on the moving trajectories of individual agents, while collective group formations are often roughly learned from video examples...
Qin Gu, Zhigang Deng
62
Voted
DAC
2009
ACM
15 years 10 months ago
Mode grouping for more effective generalized scheduling of dynamic dataflow applications
For a number of years, dataflow concepts have provided designers of digital signal processing systems with environments capable of expressing high-level software architectures as ...
William Plishker, Nimish Sane, Shuvra S. Bhattacha...
EJC
2010
14 years 9 months ago
The edge-flipping group of a graph
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
Hau-wen Huang, Chih-wen Weng