Sciweavers

21324 search results - page 396 / 4265
» Making the case for computing
Sort
View
CCGRID
2005
IEEE
15 years 10 months ago
Secret sequence comparison on public grid computing resources
Once a new gene has been sequenced, it must be verified whether or not it is similar to previously sequenced genes. In many cases, the organization that sequenced a potentially n...
Ken-ichi Kurata, Hiroshi Nakamura, Vincent Breton
COMPGEOM
2004
ACM
15 years 10 months ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
ISPD
2000
ACM
139views Hardware» more  ISPD 2000»
15 years 9 months ago
Critical area computation for missing material defects in VLSI circuits
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
Evanthia Papadopoulou
FC
2006
Springer
108views Cryptology» more  FC 2006»
15 years 8 months ago
Uncheatable Reputation for Distributed Computation Markets
Reputation systems aggregate mutual feedback of interacting peers into a "reputation" metric for each participant. This is then available to prospective service "req...
Bogdan Carbunar, Radu Sion
CCGRID
2011
IEEE
14 years 8 months ago
Towards Real-Time, Volunteer Distributed Computing
Many large-scale distributed computing applications demand real-time responses by soft deadlines. To enable such real-time task distribution and execution on the volunteer resourc...
Sangho Yi, Emmanuel Jeannot, Derrick Kondo, David ...