430 search results - page 58 / 86 » On Using Satisfiability-Based Pruning Techniques in Covering... |
101
click to vote
SIGSOFT
2006
ACM
15 years 11 months ago
2006
ACM
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
187
click to vote
ICDE
1998
IEEE
15 years 11 months ago
1998
IEEE
We study the problem of discovering association rules that display regular cyclic variation over time. For example, if we compute association rules over monthly sales data, we may...
92
Voted
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
MICCAI
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Brain imaging provides a wealth of information that computers can explore at a massive scale. Categorizing the patterns of the human cortex has been a challenging issue f...
93
Voted
EVOW
2007
Springer
15 years 2 months ago
2007
Springer
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...