Sciweavers

4911 search results - page 695 / 983
» Tree dependence analysis
Sort
View
CCE
2005
15 years 3 months ago
Selecting maximally informative genes
Microarray experiments are emerging as one of the main driving forces in modern biology. By allowing the simultaneous monitoring of the expression of the entire genome for a given...
Ioannis P. Androulakis
COMCOM
2004
149views more  COMCOM 2004»
15 years 3 months ago
Accelerating network security services with fast packet classification
To protect a network, secure network systems such as intrusion detection system (IDS) and firewall are often installed to control or monitor network traffic. These systems often i...
Shiuh-Pyng Shieh, Fu-Yuan Lee, Ya-Wen Lin
DATAMINE
1999
108views more  DATAMINE 1999»
15 years 3 months ago
A Survey of Methods for Scaling Up Inductive Algorithms
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
Foster J. Provost, Venkateswarlu Kolluri
SIGCSE
2002
ACM
149views Education» more  SIGCSE 2002»
15 years 3 months ago
A comprehensive project for CS2: combining key data structures and algorithms into an integrated web browser and search engine
We present our experience using a large, real-world application as a course project for the second half of the semester of a CS2 course. Our primary goal for the project was to cr...
Tia Newhall, Lisa Meeden
TCS
2002
15 years 3 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo