Sciweavers

6142 search results - page 627 / 1229
» The Complexity of Partition Functions
Sort
View
TCS
2008
15 years 7 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
IR
2002
15 years 6 months ago
Threshold Setting and Performance Optimization in Adaptive Filtering
An experimental adaptive filtering system, built on the Okapi search engine, is described. In addition to the regular text retrieval functions, the system requires a complex set o...
Stephen E. Robertson
INTEGRATION
1998
96views more  INTEGRATION 1998»
15 years 6 months ago
BIST for systems-on-a-chip
An increasing part of microelectronic systems is implemented on the basis of predesigned and preverified modules, so-called cores, which are reused in many instances. Core-provide...
Hans-Joachim Wunderlich
IRCDL
2010
15 years 5 months ago
Toward Conversation Retrieval
Social Network Sites can be seen as very large information repositories containing millions of text messages usually organized into complex networks involving users interacting wit...
Matteo Magnani, Danilo Montesi
NA
2010
144views more  NA 2010»
15 years 5 months ago
A binary powering Schur algorithm for computing primary matrix roots
An algorithm for computing primary roots of a nonsingular matrix A is presented. In particular, it computes the principal root of a real matrix having no nonpositive real eigenvalu...
Federico Greco, Bruno Iannazzo