Sciweavers

1764 search results - page 277 / 353
» Information granules and entropy theory in information syste...
Sort
View
AOSD
2009
ACM
13 years 11 months ago
The dataflow pointcut: a formal and practical framework
Some security concerns are sensitive to flow of information in a program execution. The dataflow pointcut has been proposed by Masuhara and Kawauchi in order to easily implement s...
Dima Alhadidi, Amine Boukhtouta, Nadia Belblidia, ...
TREC
2004
13 years 9 months ago
Can We Get A Better Retrieval Function From Machine?
The quality of an information retrieval system heavily depends on its retrieval function, which returns a similarity measurement between the query and each document in the collect...
Weiguo Fan, Wensi Xi, Edward A. Fox, Li Wang
PLPV
2011
ACM
12 years 10 months ago
Local actions for a curry-style operational semantics
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
Gordon Stewart, Andrew W. Appel
PODC
2009
ACM
14 years 8 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
MOBIHOC
2007
ACM
14 years 7 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi