801 search results - page 128 / 161 » Minimal Locked Trees |
ISSTA
2006
ACM
15 years 3 months ago
2006
ACM
There are several problem areas that must be addressed when applying randomization to unit testing. As yet no general, fully automated solution that works for all units has been p...
98
Voted
SSD
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
SIGIR
2004
ACM
15 years 3 months ago
2004
ACM
In this paper we study the problem of finding most topical named entities among all entities in a document, which we refer to as focused named entity recognition. We show that th...
DIAGRAMS
2004
Springer
15 years 3 months ago
2004
Springer
We describe a method for drawing graph-enhanced Euler diagrams using a three stage method. The first stage is to lay out the underlying Euler diagram using a multicriteria optimizi...