9842 search results - page 1346 / 1969 » Problem complexity |
145
click to vote
ICDE
2010
IEEE
16 years 7 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
235
click to vote
WCRE
2009
IEEE
16 years 2 months ago
2009
IEEE
—Code smells are poor implementation choices, thought to make object-oriented systems hard to maintain. In this study, we investigate if classes with code smells are more change-...
231
click to vote
IWCIA
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
200
click to vote
SEMCO
2008
IEEE
16 years 1 months ago
2008
IEEE
Context-aware user interfaces facilitate the user interaction by suggesting or prefilling data derived from the user’s current context. This raises the problem of mapping conte...
195
click to vote
P2P
2007
IEEE
16 years 1 months ago
2007
IEEE
Structured overlay networks form a major class of peerto-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-s...