Sciweavers

2957 search results - page 403 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
15 years 12 months ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
DATE
2003
IEEE
90views Hardware» more  DATE 2003»
15 years 11 months ago
Transistor-Level Static Timing Analysis by Piecewise Quadratic Waveform Matching
While fast timing analysis methods, such as asymptotic waveform evaluation (AWE), have been well established for linear circuits, the timing analysis for non-linear circuits, whic...
Zhong Wang, Jianwen Zhu
ICDM
2003
IEEE
225views Data Mining» more  ICDM 2003»
15 years 11 months ago
Combining the web content and usage mining to understand the visitor behavior in a web site
A web site is a semi structured collection of different kinds of data, whose motivation is show relevant information to visitor and by this way capture her/his attention. Understa...
Juan D. Velásquez, Hiroshi Yasuda, Terumasa...
ICSM
2003
IEEE
15 years 11 months ago
Reverse Engineering of the Interaction Diagrams from C++ Code
In object oriented programming, the functionalities of a system result from the interactions (message exchanges) among the objects allocated by the system. While designing object ...
Paolo Tonella, Alessandra Potrich
INFOCOM
2003
IEEE
15 years 11 months ago
Opportunistic Fair Scheduling over Multiple Wireless Channels
Abstract— Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit con...
Yonghe Liu, Edward W. Knightly