Sciweavers

272 search results - page 42 / 55
» Some Representation and Computational Issues in Social Choic...
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 4 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
ECEASST
2010
14 years 9 months ago
Safe Integration of Annotated Components in Open Source Projects
: The decision of using existing software components versus building from scratch custom software is one of the most complex and important choices of the entire development/integra...
Sergio Areias, Daniela Carneiro da Cruz, Pedro Ran...
73
Voted
WWW
2007
ACM
16 years 13 days ago
Generating efficient labels to facilitate web accessibility
For many users with a disability it can be difficult or impossible to use a computer mouse to navigate the web. An alternative way to select elements on a web page is the label ty...
Leo Spalteholz, Kin Fun Li, Nigel Livingston
WPES
2004
ACM
15 years 5 months ago
Off-the-record communication, or, why not to use PGP
Quite often on the Internet, cryptography is used to protect private, personal communications. However, most commonly, systems such as PGP are used, which use long-lived encryptio...
Nikita Borisov, Ian Goldberg, Eric A. Brewer
PDC
2004
ACM
15 years 5 months ago
Personas is not applicable: local remedies interpreted in a wider context
One of the major problems with participatory design is that it is extremely difficult to apply it to current developments. Software development for the mass market is one aspect o...
Kari Rönkkö, Mats Hellman, Britta Kiland...