Sciweavers

7200 search results - page 315 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
CIKM
2006
Springer
15 years 10 months ago
SaLSa: computing the skyline without scanning the whole sky
Skyline queries compute the set of Pareto-optimal tuples in a relation, i.e., those tuples that are not dominated by any other tuple in the same relation. Although several algorit...
Ilaria Bartolini, Paolo Ciaccia, Marco Patella
CHI
1995
ACM
15 years 10 months ago
Applying Electric Field Sensing to Human-Computer Interfaces
A non-contact sensor based on the interaction of a person with electric fields for human-computer interface is investigated. Two sensing modes are explored: an external electric f...
Thomas G. Zimmerman, Joshua R. Smith, Joseph A. Pa...
CSREASAM
2006
15 years 8 months ago
A Visual Environment for Characterization of State Changes in Computer Systems
: Traditional state modeling techniques have several limitations. One of these is the reduced ability to model a large number of variables simultaneously. Another limitation is tha...
Gregory Vert, Sergiu M. Dascalu, Frederick C. Harr...
ECCC
2007
144views more  ECCC 2007»
15 years 6 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
TON
2008
125views more  TON 2008»
15 years 6 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni