Sciweavers

195 search results - page 38 / 39
» E-voting - a Key to Independence for All
Sort
View
FGCS
2008
103views more  FGCS 2008»
13 years 7 months ago
A case for cooperative and incentive-based federation of distributed clusters
Research interest in Grid computing has grown significantly over the past five years. Management of distributed resources is one of the key issues in Grid computing. Central to ma...
Rajiv Ranjan, Aaron Harwood, Rajkumar Buyya
CN
2007
99views more  CN 2007»
13 years 7 months ago
Mistreatment-resilient distributed caching
The distributed partitioning of autonomous, self-aware nodes into cooperative groups, within which scarce resources could be effectively shared for the benefit of the group, is ...
Georgios Smaragdakis, Nikolaos Laoutaris, Azer Bes...
SIGIR
2008
ACM
13 years 7 months ago
Named entity normalization in user generated content
Named entity recognition is important for semantically oriented retrieval tasks, such as question answering, entity retrieval, biomedical retrieval, trend detection, and event and...
Valentin Jijkoun, Mahboob Alam Khalid, Maarten Mar...
TCS
2008
13 years 7 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
TPDS
2008
80views more  TPDS 2008»
13 years 7 months ago
Scalable and Efficient End-to-End Network Topology Inference
To construct an efficient overlay network, the information of underlay is important. We consider using end-to-end measurement tools such as traceroute to infer the underlay topolog...
Xing Jin, Wanqing Tu, S.-H. Gary Chan