Sciweavers

2983 search results - page 197 / 597
» The group marriage problem
Sort
View
UIST
2005
ACM
16 years 6 days ago
DTLens: multi-user tabletop spatial data exploration
Supporting groups of individuals exploring large maps and design diagrams on interactive tabletops is still an open research problem. Today’s geospatial, mechanical engineering ...
Clifton Forlines, Chia Shen
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
16 years 6 days ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
EUPROJECTS
2005
Springer
16 years 5 days ago
Participatory Insight to Universal Access: Methods and Validation Exercises
Participatory methods can, in principle, be applied for a variety of purposes to gain insight into the context of use of an artefact or the way in which tasks are performed by end ...
Michael Pieper, Karl Stroetmann
ISSAC
2005
Springer
107views Mathematics» more  ISSAC 2005»
16 years 4 days ago
Symmetric and semisymmetric graphs construction using G-graphs
Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a h...
Alain Bretto, Luc Gillibert, Bernard Laget
EUROCRYPT
2004
Springer
16 years 1 days ago
Short Signatures Without Random Oracles
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
Dan Boneh, Xavier Boyen