Sciweavers

1308 search results - page 124 / 262
» Let's Have a Conversation
Sort
View
HUC
2010
Springer
15 years 7 months ago
CU-Later: a communication system considering time difference
Despite the widespread use of technology for social communication across distance, a number of barriers to such contact still exist. One such barrier is the problem of communicati...
Hitomi Tsujita, Svetlana Yarosh, Gregory D. Abowd
CORR
2006
Springer
114views Education» more  CORR 2006»
15 years 6 months ago
A New Cryptosystem Based On Hidden Order Groups
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
Amitabh Saxena, Ben Soh
IJRR
2008
115views more  IJRR 2008»
15 years 6 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin
NAR
2008
119views more  NAR 2008»
15 years 6 months ago
TreeFam: 2008 Update
TreeFam (http://www.treefam.org) was developed to provide curated phylogenetic trees for all animal gene families, as well as orthologue and paralogue assignments. Release 4.0 of ...
Jue Ruan, Heng Li, Zhongzhong Chen, Avril Coghlan,...
JGT
2007
87views more  JGT 2007»
15 years 6 months ago
A new upper bound on the cyclic chromatic number
A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring...
Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, ...