Sciweavers

2877 search results - page 333 / 576
» The Complexity of Planarity Testing
Sort
View
ICML
2004
IEEE
16 years 5 days ago
Optimising area under the ROC curve using gradient descent
This paper introduces RankOpt, a linear binary classifier which optimises the area under the ROC curve (the AUC). Unlike standard binary classifiers, RankOpt adopts the AUC stat...
Alan Herschtal, Bhavani Raskutti
FPGA
2004
ACM
137views FPGA» more  FPGA 2004»
16 years 4 days ago
Making visible the thermal behaviour of embedded microprocessors on FPGAs: a progress report
This paper shows a method to verifying the thermal status of complex FPGA-based circuits like microprocessors. Thus, the designer can evaluate if a particular block is working bey...
Sergio López-Buedo, Eduardo I. Boemo
166
Voted
INFOCOM
2003
IEEE
16 years 21 hour ago
Smooth Multirate Multicast Congestion Control
— A significant impediment to deployment of multicast services is the daunting technical complexity of developing, testing and validating congestion control protocols fit for w...
Gu-In Kwon, John W. Byers
SAC
2003
ACM
15 years 12 months ago
Applying Information Visualization Techniques to Capture and Explore the Course of Cognitive Behavioral Therapy
Tracking and especially comparing psychotherapeutic processes is a complex task involving a large number of individual and complexly related parameters. Therefore, descriptive and...
Monika Lanzenberger, Silvia Miksch, Susanne Ohmann...
CRYPTO
2003
Springer
124views Cryptology» more  CRYPTO 2003»
15 years 12 months ago
Primality Proving via One Round in ECPP and One Iteration in AKS
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
Qi Cheng