Sciweavers

29908 search results - page 443 / 5982
» On the Complexity of
Sort
View
SIGIR
2008
ACM
15 years 7 months ago
User preference choices for complex question answering
Question answering systems increasingly need to deal with complex information needs that require more than simple factoid answers. The evaluation of such systems is usually carrie...
Mingfang Wu, Falk Scholer, Andrew Turpin
ALIFE
2005
15 years 7 months ago
Modular Interdependency in Complex Dynamical Systems
Hierarchical modularity is a familiar characteristic of a large class of natural dynamical systems. A normal interpretation of modularity is that interactions between subsystems a...
Richard A. Watson, Jordan B. Pollack
TC
2008
15 years 7 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...
TIP
2008
205views more  TIP 2008»
15 years 7 months ago
Image Denoising Using Derotated Complex Wavelet Coefficients
A method for removing additive Gaussian noise from digital images is described. It is based on statistical modeling of the coefficients of a redundant, oriented, complex multiscale...
Mark Miller, Nick G. Kingsbury
TON
2008
99views more  TON 2008»
15 years 7 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly