Sciweavers

2583 search results - page 338 / 517
» On the Representation of Timed Polyhedra
Sort
View
CHI
2006
ACM
16 years 6 months ago
"Sketching" nurturing creativity: commonalities in art, design, engineering and research
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...
Kumiyo Nakakoji, Atau Tanaka, Daniel Fallman
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 6 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
SIGMOD
2005
ACM
178views Database» more  SIGMOD 2005»
16 years 6 months ago
Towards Effective Indexing for Very Large Video Sequence Database
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity sear...
Heng Tao Shen, Beng Chin Ooi, Xiaofang Zhou
STACS
2010
Springer
16 years 1 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani