Sciweavers

10156 search results - page 1851 / 2032
» Step by Step to Histories
Sort
View
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 9 months ago
Santa Claus Meets Hypergraph Matchings
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
Arash Asadpour, Uriel Feige, Amin Saberi
ASIACRYPT
2008
Springer
15 years 9 months ago
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling...
ASPLOS
2008
ACM
15 years 9 months ago
Tapping into the fountain of CPUs: on operating system support for programmable devices
The constant race for faster and more powerful CPUs is drawing to a close. No longer is it feasible to significantly increase the speed of the CPU without paying a crushing penalt...
Yaron Weinsberg, Danny Dolev, Tal Anker, Muli Ben-...
ASSETS
2008
ACM
15 years 9 months ago
Software and technologies designed for people with autism: what do users want?
Software developers, designers and researchers have been looking to technology for solutions to help and educate people with autism for over two decades. There are many examples o...
Cynthia Putnam, Lorna Chong
ASWC
2008
Springer
15 years 9 months ago
Scalable Distributed Ontology Reasoning Using DHT-Based Partitioning
Abstract. Ontology reasoning is an indispensable step to fully exploit the implicit semantics of Semantic Web data. The inherent distribution characteristic of the Semantic Web and...
Qiming Fang, Ying Zhao, Guangwen Yang, Weimin Zhen...
« Prev « First page 1851 / 2032 Last » Next »