Sciweavers

2157 search results - page 401 / 432
» Optimal Fast Hashing
Sort
View
DAC
2010
ACM
14 years 6 months ago
Node addition and removal in the presence of don't cares
This paper presents a logic restructuring technique named node addition and removal (NAR). It works by adding a node into a circuit to replace an existing node and then removing t...
Yung-Chih Chen, Chun-Yao Wang
BMCBI
2011
14 years 3 months ago
Elastic SCAD as a novel penalization method for SVM classification tasks in high-dimensional data
Background: Classification and variable selection play an important role in knowledge discovery in highdimensional data. Although Support Vector Machine (SVM) algorithms are among...
Natalia Becker, Grischa Toedt, Peter Lichter, Axel...
SDM
2011
SIAM
232views Data Mining» more  SDM 2011»
14 years 2 months ago
A Sequential Dual Method for Structural SVMs
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
Shirish Krishnaj Shevade, Balamurugan P., S. Sunda...
SIGIR
2011
ACM
14 years 2 months ago
Inverted indexes for phrases and strings
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
Manish Patil, Sharma V. Thankachan, Rahul Shah, Wi...
SPAA
2010
ACM
15 years 4 months ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...