Sciweavers

7821 search results - page 1332 / 1565
» Nested Ordered Sets and their Use for Data Modelling
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis
SCIA
2007
Springer
154views Image Analysis» more  SCIA 2007»
16 years 22 days ago
3D Deformable Registration for Monitoring Radiotherapy Treatment in Prostate Cancer
Two deformable registration methods, the Demons and the Morphon algorithms, have been used for registration of CT datasets to evaluate their usability in radiotherapy planning for ...
Borja Rodríguez-Vila, Johanna Pettersson, M...
ESCIENCE
2006
IEEE
16 years 20 days ago
Grid Approach to Embarrassingly Parallel CPU-Intensive Bioinformatics Problems
Bioinformatics algorithms such as sequence alignment methods based on profile-HMM (Hidden Markov Model) are popular but CPU-intensive. If large amounts of data are processed, a s...
Heinz Stockinger, Marco Pagni, Lorenzo Cerutti, La...
INFOCOM
2002
IEEE
15 years 11 months ago
Efficient Hardware Architecture for Fast IP Address Lookup
 A multigigabit IP router may receive several millions packets per second from each input link. For each packet, the router needs to find the longest matching prefix in the forw...
Derek C. W. Pao, Angus Wu, Cutson Liu, Kwan Lawren...
SPIRE
2001
Springer
15 years 11 months ago
Speed-up of Aho-Corasick Pattern Matching Machines by Rearranging States
Thispaper describes speed-up of string pattern matchingby rearrangingstates inAho-Corasickpattern matching machine, which is a kind of afinite automaton. Werealized speed-up of st...
T. Nishimura, Shuichi Fukamachi, Takeshi Shinohara
« Prev « First page 1332 / 1565 Last » Next »