Sciweavers

1102 search results - page 141 / 221
» Distributed Key Generation for the Internet
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 3 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez
COMCOM
2002
105views more  COMCOM 2002»
15 years 2 months ago
An intensive survey of fair non-repudiation protocols
With the phenomenal growth of the Internet and open networks in general, security services, such as non-repudiation, become crucial to many applications. Nonrepudiation services m...
Steve Kremer, Olivier Markowitch, Jianying Zhou
INCDM
2010
Springer
172views Data Mining» more  INCDM 2010»
15 years 1 months ago
Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
Faraz Zaidi, Daniel Archambault, Guy Melanç...
WWW
2008
ACM
16 years 3 months ago
Keysurf: a character controlled browser for people with physical disabilities
For many users with a physical or motor disability, using a computer mouse or other pointing device to navigate the web is cumbersome or impossible due to problems with pointing a...
Leo Spalteholz, Kin Fun Li, Nigel Livingston, Foad...
WWW
2006
ACM
16 years 3 months ago
Optimizing scoring functions and indexes for proximity search in type-annotated corpora
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
Soumen Chakrabarti, Kriti Puniyani, Sujatha Das