Sciweavers

3702 search results - page 21 / 741
» All Pairings Are in a Group
Sort
View
102
Voted
SEMWEB
2010
Springer
14 years 10 months ago
One Size Does Not Fit All: Customizing Ontology Alignment Using User Feedback
Abstract. A key problem in ontology alignment is that different ontological features (e.g., lexical, structural or semantic) vary widely in their importance for different ontology ...
Songyun Duan, Achille Fokoue, Kavitha Srinivas
139
Voted
GLOBECOM
2010
IEEE
14 years 9 months ago
Circulant-Graph-Based Fault-Tolerant Routing for All-Optical WDM LANs
High demands in data delivery latency and communication reliability encourage the use of fault-toleranceenhanced all-optical WDM networks. Low latency is satisfied by setting up a ...
Dexiang Wang, Janise McNair
IJNSEC
2006
94views more  IJNSEC 2006»
15 years 12 days ago
Construction of Dynamic Threshold Decryption Scheme from Pairing
The first dynamic threshold decryption scheme from pairing is presented. It is secure in groups equipped with a bilinear map, and caters to some important requirements in real app...
Yu Long, Kefei Chen
101
Voted
NAR
2008
78views more  NAR 2008»
15 years 11 days ago
InParanoid 6: eukaryotic ortholog clusters with inparalogs
The InParanoid eukaryotic ortholog database (http://InParanoid.sbc.su.se/) has been updated to version 6 and is now based on 35 species. We collected all available `complete'...
Ann-Charlotte Berglund, Erik Sjölund, Gabriel...
ESEM
2008
ACM
15 years 2 months ago
Pair programming: what's in it for me?
Pair programming is a practice in which two programmers work collaboratively at one computer on the same design, algorithm, or code. Prior research on pair programming has primari...
Andrew Begel, Nachiappan Nagappan