Sciweavers

1792 search results - page 222 / 359
» Requirements Capture with RCAT
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 7 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
KDD
2009
ACM
132views Data Mining» more  KDD 2009»
16 years 7 months ago
Learning patterns in the dynamics of biological networks
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...
Chang Hun You, Lawrence B. Holder, Diane J. Cook
PODS
2009
ACM
86views Database» more  PODS 2009»
16 years 7 months ago
Reverse data exchange: coping with nulls
An inverse of a schema mapping M is intended to "undo" what M does, thus providing a way to perform "reverse" data exchange. In recent years, three different f...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
MOBISYS
2009
ACM
16 years 7 months ago
A framework of energy efficient mobile sensing for automatic user state recognition
Urban sensing, participatory sensing, and user activity recognition can provide rich contextual information for mobile applications such as social networking and location-based se...
Yi Wang, Jialiu Lin, Murali Annavaram, Quinn Jacob...
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 7 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...