61 search results - page 8 / 13 » Approximate Confidence Computation in Probabilistic Database... |
EDBT
2008
ACM
14 years 9 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
SCCC
1997
IEEE
14 years 1 months ago
1997
IEEE
A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to thei...
CVPR
2005
IEEE
14 years 11 months ago
2005
IEEE
Researchers have been working on human face recognition for decades. Face recognition is hard due to different types of variations in face images, such as pose, illumination and e...
AAAI
2004
13 years 10 months ago
2004
Obtaining an accurate multiple alignment of protein sequences is a difficult computational problem for which many heuristic techniques sacrifice optimality to achieve reasonable r...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
This article tries to give an answer to a fundamental question in temporal data mining: "Under what conditions a temporal rule extracted from up-to-date temporal data keeps i...