Sciweavers

702 search results - page 123 / 141
» Diagnosis of t s-Diagnosable Systems
Sort
View
AAAI
2008
13 years 10 months ago
Clause Learning Can Effectively P-Simulate General Propositional Resolution
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, A...
BMEI
2008
IEEE
13 years 9 months ago
Clustering of High-Dimensional Gene Expression Data with Feature Filtering Methods and Diffusion Maps
The importance of gene expression data in cancer diagnosis and treatment by now has been widely recognized by cancer researchers in recent years. However, one of the major challen...
Rui Xu, Steven Damelin, Boaz Nadler, Donald C. Wun...
CHI
2005
ACM
13 years 9 months ago
Experience buffers: a socially appropriate, selective archiving tool for evidence-based care
Diagnosis, treatment, and monitoring of interventions for children with autism can profit most when caregivers have substantial amounts of data they can easily record and review a...
Gillian R. Hayes, Khai N. Truong, Gregory D. Abowd...
MVA
2007
155views Computer Vision» more  MVA 2007»
13 years 9 months ago
Pre-processing Algorithms on Digital Mammograms
Mammography is the best method for early mass detection. In order to limit the search for abnormalities by Computer Aided Diagnosis systems to the region of the breast without und...
Hengameh Mirzaalian, Mohammad Reza Ahmadzadeh, Sae...
NIPS
2007
13 years 9 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh