131 search results - page 9 / 27 » Leftist Canonical Ordering |
POPL
1993
ACM
14 years 1 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
AAAI
2006
13 years 11 months ago
2006
This paper studies a text mining problem, comparative sentence mining. A comparative sentence expresses an ordering relation between two sets of entities with respect to some comm...
AI
1999
Springer
13 years 9 months ago
1999
Springer
In this paper, we first discuss the meaning of physical embodiment and the complexity of the environment in the context of multi-agent learning. We then propose a vision-based rei...
BMVC
2010
13 years 7 months ago
2010
We introduce a method for image retrieval that leverages the implicit information about object importance conveyed by the list of keyword tags a person supplies for an image. We p...