Sciweavers

2778 search results - page 479 / 556
» Limit complexities revisited
Sort
View
SIGECOM
2009
ACM
83views ECommerce» more  SIGECOM 2009»
16 years 20 days ago
The price of truthfulness for pay-per-click auctions
We analyze the problem of designing a truthful pay-per-click auction where the click-through-rates (CTR) of the bidders are unknown to the auction. Such an auction faces the class...
Nikhil R. Devanur, Sham M. Kakade
SIGIR
2009
ACM
16 years 20 days ago
Addressing morphological variation in alphabetic languages
The selection of indexing terms for representing documents is a key decision that limits how effective subsequent retrieval can be. Often stemming algorithms are used to normaliz...
Paul McNamee, Charles K. Nicholas, James Mayfield
ACSAC
2008
IEEE
16 years 20 days ago
Systematic Signature Engineering by Re-use of Snort Signatures
Most intrusion detection systems apply the misuse detection approach. Misuse detection compares recorded audit data with predefined patterns denoted as signatures. A signature is ...
Sebastian Schmerl, Hartmut König, Ulrich Fleg...
CGO
2008
IEEE
16 years 19 days ago
Cole: compiler optimization level exploration
Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact on code quality, compilation time, code size,...
Kenneth Hoste, Lieven Eeckhout
FCCM
2008
IEEE
160views VLSI» more  FCCM 2008»
16 years 19 days ago
Facilitating Processor-Based DPR Systems for non-DPR Experts
Currently, only Xilinx Field Programmable Gate Arrays (FPGAs) support Dynamic Partial Reconfiguration (DPR). While there is currently some Computer Aided Design (CAD) tool support...
Edward Chen, William A. Gruver, Dorian Sabaz, Lesl...