Sciweavers

3547 search results - page 200 / 710
» Computers Seeing People
Sort
View
ICDT
2009
ACM
129views Database» more  ICDT 2009»
16 years 5 months ago
Faster join-projects and sparse matrix multiplications
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...
Rasmus Resen Amossen, Rasmus Pagh
CHI
2007
ACM
16 years 4 months ago
A gestural input through finger writing on a textured pad
We describe a new input method that utilizes patterned vibration that is generated through the finger writing on a textured pad. Using a flexible or a foldable textured pad which ...
Ji-Eun Kim, John Sunwoo, Yong-Ki Son, Dong-Woo Lee...
DCC
2008
IEEE
16 years 4 months ago
Coprimitive sets and inextendable codes
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
T. L. Alderson, Aiden A. Bruen
DCC
2008
IEEE
16 years 4 months ago
On solving sparse algebraic equations over finite fields
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Igor Semaev
DCC
2004
IEEE
16 years 4 months ago
Periodicity and Correlation Properties of d-FCSR Sequences
A d-feedback-with-carry shift register (d-FCSR) is a finite state machine, similar to a linear feedback shift register, in which a small amount of memory and a delay (by d-clock c...
Mark Goresky, Andrew Klapper