1221 search results - page 119 / 245 » A Comparison of Two Programming Models for Pervasive Computi... |
108
Voted
RECOMB
2005
Springer
16 years 3 months ago
2005
Springer
A considerable fraction of yeast gene promoters are bound by multiple transcription factors. To study the combinatorial interactions of multiple transcription factors is thus impor...
153
Voted
EC
1998
15 years 3 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
146
Voted
SIGGRAPH
1993
ACM
15 years 7 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
116
Voted
PPPJ
2006
ACM
15 years 9 months ago
2006
ACM
In this paper we present a JXTA-based platform, called Juxta-CAT, which is an effort to use the JXTA architecture to build a job execution-sharing distributed environment. The Ju...
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
We deal with the problem of obtaining rigorous bounds to the position of 3-D points computed by stereo triangulation when both the camera matrix and the image points are affected ...