Sciweavers

4378 search results - page 534 / 876
» On the Complexity of Ordered Colourings
Sort
View
SEMWEB
2009
Springer
16 years 1 months ago
XLWrap - Querying and Integrating Arbitrary Spreadsheets with SPARQL
In this paper a novel approach is presented for generating RDF graphs of arbitrary complexity from various spreadsheet layouts. Currently, none of the available spreadsheet-to-RDF ...
Andreas Langegger, Wolfram Wöß
COMPGEOM
2009
ACM
16 years 1 months ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
HT
2009
ACM
16 years 1 months ago
On hypertext narrative
Annals and chronicles may be the foundation of accounting, but writers of stories and histories have long known that they seldom render a satisfactory account of complex events. I...
Mark Bernstein
MM
2009
ACM
196views Multimedia» more  MM 2009»
16 years 1 months ago
Mirror world navigation for mobile users based on augmented reality
Finding a destination in unfamiliar environments of complex office building or shopping mall has been always bothering us in daily life. Fine-scale directional guidance, a combina...
Patricia P. Wang, Tao Wang, Dayong Ding, Yimin Zha...
ARC
2010
Springer
178views Hardware» more  ARC 2010»
16 years 1 months ago
An Analysis of Delay Based PUF Implementations on FPGA
Physical Unclonable Functions promise cheap, efficient, and secure identification and authentication of devices. In FPGA devices, PUFs may be instantiated directly from FPGA fabri...
Sergey Morozov, Abhranil Maiti, Patrick Schaumont