Sciweavers

998 search results - page 153 / 200
» From Feasible Proofs to Feasible Computations
Sort
View
TROB
2002
138views more  TROB 2002»
15 years 5 months ago
Interference-free polyhedral configurations for stacking
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...
Venkateswara R. Ayyadevara, David A. Bourne, Kenji...
ICCV
2003
IEEE
15 years 11 months ago
What Does Motion Reveal About Transparency?
The perception of transparent objects from images is known to be a very hard problem in vision. Given a single image, it is difficult to even detect the presence of transparent o...
Moshe Ben-Ezra, Shree K. Nayar
PODC
2009
ACM
16 years 6 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
ISMB
1993
15 years 7 months ago
Minimizing Complexity in Cellular Automata Models of Self-Replication
Understanding self-replication from an information processing perspective is important because, amongother things, it can shed light on molecular mechanismsof biological reproduct...
James A. Reggia, Hui-Hsien Chou, Steven L. Armentr...
BMCBI
2008
87views more  BMCBI 2008»
15 years 6 months ago
Identification of deleterious non-synonymous single nucleotide polymorphisms using sequence-derived information
Background: As the number of non-synonymous single nucleotide polymorphisms (nsSNPs), also known as single amino acid polymorphisms (SAPs), increases rapidly, computational method...
Jing Hu, Changhui Yan