Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
TC
2011
10 years 8 months ago
Performing Arithmetic Operations on Round-to-Nearest Representations
—During any composite computation, there is a constant need for rounding intermediate results before they can participate in further processing. Recently, a class of number repre...
Peter Kornerup, Jean-Michel Muller, Adrien Panhale...
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
10 years 11 months ago
Improved Consistent Sampling, Weighted Minhash and L1 Sketching
Abstract--We propose a new Consistent Weighted Sampling method, where the probability of drawing identical samples for a pair of inputs is equal to their Jaccard similarity. Our me...
Sergey Ioffe
ALGORITHMICA
2005
97views more  ALGORITHMICA 2005»
11 years 1 months ago
Representing Trees of Higher Degree
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
David Benoit, Erik D. Demaine, J. Ian Munro, Rajee...
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
11 years 3 months ago
Succinct Representations of Arbitrary Graphs
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
Arash Farzan, J. Ian Munro
ARITH
1999
IEEE
11 years 5 months ago
Necessary and Sufficient Conditions for Parallel, Constant Time Conversion and Addition
This note presents necessary and sufficient conditions for parallel and constant time conversions from one digit-set into another, and thus also for constant time addition. In the...
Peter Kornerup
ADAEUROPE
2003
Springer
11 years 6 months ago
Charles: A Data Structure Library for Ada95
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
Matthew Heaney
SI3D
2006
ACM
11 years 7 months ago
Jump flooding in GPU with applications to Voronoi diagram and distance transform
This paper studies jump flooding as an algorithmic paradigm in the general purpose computation with GPU. As an example application of jump flooding, the paper discusses a constant...
Guodong Rong, Tiow Seng Tan
IPPS
2007
IEEE
11 years 7 months ago
Constant Time Simulation of an R-Mesh on an LR-Mesh
Recently, many parallel computing models using dynamically reconfigurable electrical buses have been proposed in the literature. The underlying characteristics are similar among ...
Carlos Alberto Córdova-Flores, José ...
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
11 years 8 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
11 years 11 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon
books