Sciweavers

735 search results - page 138 / 147
» Margin based feature selection - theory and algorithms
Sort
View
ISPASS
2006
IEEE
14 years 1 months ago
Critical path analysis of the TRIPS architecture
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...
Ramadass Nagarajan, Xia Chen, Robert G. McDonald, ...
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 11 months ago
Beyond heuristics: learning to classify vulnerabilities and predict exploits
The security demands on modern system administration are enormous and getting worse. Chief among these demands, administrators must monitor the continual ongoing disclosure of sof...
Mehran Bozorgi, Lawrence K. Saul, Stefan Savage, G...
BMCBI
2005
147views more  BMCBI 2005»
13 years 7 months ago
GATA: a graphic alignment tool for comparative sequence analysis
Background: Several problems exist with current methods used to align DNA sequences for comparative sequence analysis. Most dynamic programming algorithms assume that conserved se...
David A. Nix, Michael B. Eisen
SIGIR
2012
ACM
11 years 10 months ago
Time-sensitive query auto-completion
Query auto-completion (QAC) is a common feature in modern search engines. High quality QAC candidates enhance search experience by saving users time that otherwise would be spent ...
Milad Shokouhi, Kira Radinsky
WWW
2007
ACM
14 years 8 months ago
Query-driven indexing for peer-to-peer text retrieval
We describe a query-driven indexing framework for scalable text retrieval over structured P2P networks. To cope with the bandwidth consumption problem that has been identified as ...
Gleb Skobeltsyn, Toan Luu, Karl Aberer, Martin Raj...