Sciweavers

1816 search results - page 59 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
CVPR
2003
IEEE
16 years 8 months ago
Simultaneous Estimation of Left Ventricular Motion and Material Properties with Maximum a Posteriori Strategy
In addition to its technical merits as a challenging non-rigid motion and structural integrity analysis problem, quantitative estimation of cardiac regional functions and material...
Huafeng Liu, Pengcheng Shi
ENGL
2007
103views more  ENGL 2007»
15 years 5 months ago
Fault Diagnosis of Manufacturing Processes via Genetic Algorithm Approach
—Instantaneous detection and diagnosis of various faults and break-downs in industrial processes is required to reduce production losses and damage to equipments. A solved knowle...
Stefania Gallova
ECAI
1990
Springer
15 years 10 months ago
Knowledge-Intensive Case-Based Reasoning and Sustained Learning
In case-based reasoning (CBR) a problem is solved by matching the problem description to a previously solved case, using the past solution in solving the new problem. A case-based...
Agnar Aamodt
FAST
2008
15 years 8 months ago
Portably Solving File TOCTTOU Races with Hardness Amplification
The file-system API of contemporary systems makes programs vulnerable to TOCTTOU (time of check to time of use) race conditions. Existing solutions either help users to detect the...
Dan Tsafrir, Tomer Hertz, David Wagner, Dilma Da S...
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 9 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski