Sciweavers

1265 search results - page 10 / 253
» Finding the Key to a Synapse
Sort
View
IJIS
2008
83views more  IJIS 2008»
13 years 7 months ago
An algorithm for modelling key terms
The ability to analyse and represent formally semantic relations of terms is a core issue in information retrieval (IR), natural language processing (NLP), and in many related are...
D. Cai, C. J. van Rijsbergen
CORR
2007
Springer
116views Education» more  CORR 2007»
13 years 7 months ago
On the Low-SNR Capacity of Phase-Shift Keying with Hard-Decision Detection
1 The low-SNR capacity of M-ary PSK transmission over both the additive white Gaussian noise (AWGN) and fading channels is analyzed when hard-decision detection is employed at the ...
Mustafa Cenk Gursoy
IOR
2010
71views more  IOR 2010»
13 years 4 months ago
Stochastic Root Finding and Efficient Estimation of Convex Risk Measures
Reliable risk measurement is a key problem for financial institutions and regulatory authorities. The current industry standard Value-at-Risk has several deficiencies. Improved ri...
Jörn Dunkel, Stefan Weber
TCS
2008
13 years 7 months ago
Finding a minimum medial axis of a discrete shape is NP-hard
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
David Coeurjolly, Jérôme Hulin, Isabe...
TCS
2010
13 years 2 months ago
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
Mauro Mezzini