Sciweavers

4926 search results - page 70 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
14 years 2 months ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
DCC
2001
IEEE
14 years 7 months ago
Towards Compressing Web Graphs
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
Micah Adler, Michael Mitzenmacher
ICCV
1999
IEEE
14 years 9 months ago
A Bidirectional Matching Algorithm for Deformable Pattern Detection with Application to Handwritten Word Retrieval
A Bayesian framework for deformable pattern classification has been proposed in [1] with promising results for isolated handwritten character recognition. Its performance, however...
Kwok-Wai Cheung, Dit-Yan Yeung, Roland T. Chin
TLCA
2005
Springer
14 years 1 months ago
Subtyping Recursive Types Modulo Associative Commutative Products
This work sets the formal bases for building tools that help retrieve classes in object-oriented libraries. In such systems, the user provides a query, formulated as a set of class...
Roberto Di Cosmo, François Pottier, Didier ...
ASIACRYPT
2008
Springer
13 years 9 months ago
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the...
Xiaoming Sun, Andrew Chi-Chih Yao, Christophe Tart...