Sciweavers

1225 search results - page 79 / 245
» The Instance Complexity Conjecture
Sort
View
JACM
2000
119views more  JACM 2000»
13 years 8 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
DLOG
2009
13 years 6 months ago
A Matter of Principles: Towards the Largest DLP Possible
Abstract. Description Logic Programs (DLP) have been described as a description logic (DL) that is in the "expressive intersection" of DL and datalog. This is a very weak...
Markus Krötzsch, Sebastian Rudolph
PERCOM
2011
ACM
13 years 22 days ago
Market mechanisms for Value of Information driven resource allocation in Sensor Networks
—This paper examines the possible uses of different market mechanisms for resource allocation at different levels of Wireless Sensor Network (WSN) architecture. The goal is to ma...
Boleslaw K. Szymanski, S. Yousaf Shah, Sahin Cem G...
GECCO
2009
Springer
118views Optimization» more  GECCO 2009»
14 years 3 months ago
The impact of network topology on self-organizing maps
In this paper, we study instances of complex neural networks, i.e. neural networks with complex topologies. We use Self-Organizing Map neural networks whose neighborhood relations...
Fei Jiang, Hugues Berry, Marc Schoenauer
ICC
2007
IEEE
14 years 3 months ago
Widely Linear Prediction for Blind Equalization
— This paper proposes a new blind equalization scheme based on widely linear (WL) prediction. It permits to compensate non-minimum phase channels with or without spectral nulls, ...
Francisco J. A. de Aquino, Carlos A. F. da Rocha, ...