4095 search results - page 487 / 819 » How to test a tree |
171
click to vote
ICML
2000
IEEE
16 years 6 months ago
2000
IEEE
Clustering algorithms conduct a search through the space of possible organizations of a data set. In this paper, we propose two types of instance-level clustering constraints ? mu...
143
click to vote
SIGSOFT
2002
ACM
16 years 6 months ago
2002
ACM
This paper explores the idea that redundant operations, like type errors, commonly flag correctness errors. We experimentally test this idea by writing and applying four redundanc...
154
click to vote
SIGSOFT
2002
ACM
16 years 6 months ago
2002
ACM
Consider the execution of a failing program as a sequence of program states. Each state induces the following state, up to the failure. Which variables and values of a program sta...
144
click to vote
ISBI
2006
IEEE
16 years 6 months ago
2006
IEEE
Our goal is to optimize regularized image reconstruction methods for emission tomography with respect to the task of detecting small lesions of unknown location in the reconstruct...
150
click to vote
WWW
2007
ACM
16 years 6 months ago
2007
ACM
We present an incremental algorithm for building a neighborhood graph from a set of documents. This algorithm is based on a population of artificial agents that imitate the way re...