900 search results - page 86 / 180 » On Polynomial Time Computation over Unordered Structures |
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
— We study the end-to-end resource allocation in an OFDM based multi-hop network consisting of a one-dimensional chain of nodes including a source, a destination, and multiple re...
SIAMCOMP
2000
13 years 8 months ago
2000
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
CGA
1998
13 years 8 months ago
1998
This paper describes methods and data structures used to leverage motion sequences of complex linked figures. We present a technique for interpolating between example motions der...
COLING
2010
13 years 3 months ago
2010
We present novel kernels based on structured and unstructured features for reranking the N-best hypotheses of conditional random fields (CRFs) applied to entity extraction. The fo...
APWEB
2004
Springer
14 years 2 months ago
2004
Springer
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...