Sciweavers

132 search results - page 23 / 27
» Polite Theories Revisited
Sort
View
COMPGEOM
2004
ACM
14 years 24 days ago
New results on shortest paths in three dimensions
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
Joseph S. B. Mitchell, Micha Sharir
CHI
2007
ACM
13 years 11 months ago
An exploration of web-based monitoring: implications for design
Monitoring occurs when users return to previously viewed web pages to view new or updated information. While tools exist to support web-based monitoring, we know little about the ...
Melanie Kellar, Carolyn R. Watters, Kori M. Inkpen
CORR
2007
Springer
147views Education» more  CORR 2007»
13 years 7 months ago
Coding Solutions for the Secure Biometric Storage Problem
—The paper studies the problem of securely storing biometric passwords, such as fingerprints and irises. With the help of coding theory Juels and Wattenberg derived in 1999 a sc...
Davide Schipani, Joachim Rosenthal
IJCM
2010
80views more  IJCM 2010»
13 years 5 months ago
On implementing recognizable transductions
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
Stavros Konstantinidis, Nicolae Santean, S. Yu
WWW
2009
ACM
14 years 8 months ago
How opinions are received by online communities: a case study on amazon.com helpfulness votes
There are many on-line settings in which users publicly express opinions. A number of these offer mechanisms for other users to evaluate these opinions; a canonical example is Ama...
Cristian Danescu-Niculescu-Mizil, Gueorgi Kossinet...