16883 search results - page 268 / 3377 » Generalized Non-Reducible Descriptors |
156
click to vote
CIKM
2004
Springer
16 years 1 days ago
2004
Springer
Endeca’s approach to processing search queries in a distributed computing environment is predicated on concerns of correctness, scalability, and flexibility in deployment. Using...
184
click to vote
ICMI
2004
Springer
16 years 20 hour ago
2004
Springer
We are interested in applying and extending existing frameworks for combining output modalities for adaptations of multimodal content on heterogeneous devices based on user and de...
202
click to vote
SAPIR
2004
Springer
16 years 55 min ago
2004
Springer
We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at...
164
click to vote
WWW
2010
ACM
15 years 12 months ago
2010
ACM
This paper studies the compressibility of RDF data sets. We show that big RDF data sets are highly compressible due to the structure of RDF graphs (power law), organization of URI...
180
click to vote
COMPGEOM
2003
ACM
15 years 12 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...