Sciweavers

3575 search results - page 683 / 715
» Presentations of computably enumerable reals
Sort
View
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
16 years 7 days ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
EDBT
2002
ACM
125views Database» more  EDBT 2002»
15 years 12 months ago
Estimating Answer Sizes for XML Queries
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
MOBISYS
2005
ACM
15 years 11 months ago
Shake them up!: a movement-based pairing protocol for CPU-constrained devices
This paper presents a new pairing protocol that allows two CPU-constrained wireless devices Alice and Bob to establish a shared secret at a very low cost. To our knowledge, this i...
Claude Castelluccia, Pars Mutaf
MOBISYS
2005
ACM
15 years 11 months ago
LiveMail: personalized avatars for mobile entertainment
LiveMail is a prototype system that allows mobile subscribers to communicate using personalized 3D face models created from images taken by their phone cameras. The user takes a s...
Miran Mosmondor, Tomislav Kosutic, Igor S. Pandzic
MOBIHOC
2006
ACM
15 years 11 months ago
DRAND: : distributed randomized TDMA scheduling for wireless ad-hoc networks
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
Injong Rhee, Ajit Warrier, Jeongki Min, Lisong Xu