Sciweavers

6251 search results - page 91 / 1251
» Randomness, Computability, and Density
Sort
View
COMCOM
2008
82views more  COMCOM 2008»
13 years 10 months ago
Virtual password using random linear functions for on-line services, ATM machines, and pervasive computing
People enjoy the convenience of on-line services, Automated Teller Machines (ATMs), and pervasive computing, but online environments, ATMs, and pervasive computing may bring many r...
Ming Lei, Yang Xiao, Susan V. Vrbsky, Chung-Chih L...
ISCIS
2005
Springer
14 years 3 months ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy
COMPGEOM
1994
ACM
14 years 2 months ago
Computing Many Faces in Arrangements of Lines and Segments
We present randomized algorithms for computing many faces in an arrangement of lines or of segments in the plane, which are considerably simpler and slightly faster than the previo...
Pankaj K. Agarwal, Jirí Matousek, Otfried S...
TPDS
2010
135views more  TPDS 2010»
13 years 8 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat
CVPR
1996
IEEE
14 years 12 months ago
Randomness and Geometric Features in Computer Vision
Xavier Pennec, Nicholas Ayache