Sciweavers

102291 search results - page 161 / 20459
» Computing
Sort
View
207
Voted
BMCBI
2007
120views more  BMCBI 2007»
15 years 7 months ago
Computational analyses of eukaryotic promoters
Computational analysis of eukaryotic promoters is one of the most difficult problems in computational genomics and is essential for understanding gene expression profiles and reve...
Michael Q. Zhang
180
Voted
IAJIT
2006
109views more  IAJIT 2006»
15 years 7 months ago
Unconstraint Assignment Problem: A Molecular Computing Approach
: Deoxyribonucleic Acid or DNA-based computing is an emerging field that bridging the gap between chemistry, molecular biology, computer science, and mathematics. This research are...
Zuwairie Ibrahim, Yusei Tsuboi, Osamu Ono, Marzuki...
JUCS
2008
151views more  JUCS 2008»
15 years 7 months ago
Bloch's Constant is Computable
: We prove the computability of Bloch's constant by presenting the first algorithm approximating the constant up to arbitrary precision. Key Words: computability, algorithm, B...
Robert Rettinger
PUC
2002
74views more  PUC 2002»
15 years 7 months ago
Smart Playing Cards: A Ubiquitous Computing Game
Abstract. We present the "Smart Playing Cards" application, a ubiquitous computing game that augments a classical card game with information
Kay Römer, Svetlana Domnitcheva
PERCOM
2010
ACM
15 years 5 months ago
A visual, open-ended approach to prototyping ubiquitous computing applications
By nature, ubiquitous computing applications are intimately intertwined with users' everyday life. This situation is challenging because it requires to make the development of...
Zoé Drey, Charles Consel
« Prev « First page 161 / 20459 Last » Next »