Sciweavers

110 search results - page 19 / 22
» Complexity Classes as Mathematical Axioms
Sort
View
SPAA
2009
ACM
15 years 4 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
IMAGING
2003
14 years 11 months ago
Group Theoretical Invariants in Color Image Processing
Many image formation processes are complex interactions of several sub-processes and the analysis of the resulting images requires often to separate the influence of these sub-pr...
Reiner Lenz, Linh Viet Tran, Thanh Hai Bui
NIPS
1997
14 years 11 months ago
Minimax and Hamiltonian Dynamics of Excitatory-Inhibitory Networks
A Lyapunov function for excitatory-inhibitory networks is constructed. The construction assumes symmetric interactions within excitatory and inhibitory populations of neurons, and...
H. Sebastian Seung, Tom J. Richardson, J. C. Lagar...
WWW
2011
ACM
14 years 5 months ago
Towards semantic knowledge propagation from text corpus to web images
In this paper, we study the problem of transfer learning from text to images in the context of network data in which link based bridges are available to transfer the knowledge bet...
Guojun Qi, Charu C. Aggarwal, Thomas Huang
PODS
2007
ACM
171views Database» more  PODS 2007»
15 years 10 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei