Sciweavers

2555 search results - page 447 / 511
» Putting complex systems to work
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 11 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
VLDB
2003
ACM
165views Database» more  VLDB 2003»
14 years 11 months ago
Learning to match ontologies on the Semantic Web
On the Semantic Web, data will inevitably come from many different ontologies, and information processing across ontologies is not possible without knowing the semantic mappings be...
AnHai Doan, Jayant Madhavan, Robin Dhamankar, Pedr...
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
14 years 11 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
SAC
2009
ACM
14 years 6 months ago
Using geo-spatial session tagging for smart multicast session discovery
IP multicast is increasingly seen as efficient mode of live content distribution in the Internet to significantly large subscriber bases. Despite its numerous benefits over IP u...
Piyush Harsh, Richard Newman
FOCS
2009
IEEE
14 years 5 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...