Sciweavers

948 search results - page 24 / 190
» What can we achieve by arbitrary announcements
Sort
View
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
14 years 1 months ago
Don't Compare Averages
We point out that for two sets of measurements, the sign of the difference of their averages is not necessarily maintained by a non-linear monotone transformation of the individu...
Holger Bast, Ingmar Weber
KDD
1998
ACM
102views Data Mining» more  KDD 1998»
13 years 11 months ago
Defining the Goals to Optimise Data Mining Performance
In many data mining problems the definition of what structures in the database are to be regarded as interesting or valuable is given only loosely. Typically this is regarded as a...
Mark G. Kelly, David J. Hand, Niall M. Adams
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
14 years 1 months ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...
INFOCOM
2009
IEEE
14 years 2 months ago
SDL Constructions of FIFO, LIFO and Absolute Contractors
— Despite all the recent advances in the mathematical theories for constructing optical queues by optical Switches and fiber Delay Lines (SDL), there are still many problems tha...
Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee
ASIACRYPT
2005
Springer
14 years 1 months ago
Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application
In this paper, we discuss non-interactive updating of decryption keys in identity-based encryption (IBE). IBE is a public key cryptosystem where a public key is an arbitrary strin...
Yumiko Hanaoka, Goichiro Hanaoka, Junji Shikata, H...