15416 search results - page 2752 / 3084 » Embeddings of Computable Structures |
204
Voted
DAGSTUHL
2010
15 years 8 months ago
2010
While tensors occur in many areas of science and engineering, little has been done to visualize tensors with order higher than two. Tensors of higher orders can be used for exampl...
158
click to vote
DAGSTUHL
2010
15 years 8 months ago
2010
Computer support for intervention planning is a two-stage process: In a first stage, the relevant segmentation target structures are identified and delineated. In a second stage, ...
181
click to vote
CSC
2008
15 years 8 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
170
click to vote
LREC
2010
15 years 8 months ago
2010
Today's natural language processing systems are growing more complex with the need to incorporate a wider range of language resources and more sophisticated statistical metho...
161
click to vote
LREC
2010
15 years 8 months ago
2010
In this paper, we describe our experience with collecting and creating an annotated corpus of multi-party online conversations in a chat-room environment. This effort is part of a...