780 search results - page 77 / 156 » Reasoning about sets using redescription mining |
87
Voted
PLDI
2012
ACM
13 years 3 months ago
2012
ACM
When program verification tools fail to verify a program, either the program is buggy or the report is a false alarm. In this situation, the burden is on the user to manually cla...
101
Voted
TASE
2009
IEEE
15 years 7 months ago
2009
IEEE
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...
109
Voted
DLOG
2010
14 years 10 months ago
2010
Abstract. A usage scenario of bio-ontologies is hypothesis testing, such as finding relationships or new subconcepts in the data linked to the ontology. Whilst validating the hypot...
95
Voted
PLDI
2010
ACM
15 years 10 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
107
Voted
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
Multi-Document Summarization deals with computing a summary for a set of related articles such that they give the user a general view about the events. One of the objectives is th...