Sciweavers

3778 search results - page 340 / 756
» Erdos-Ko-Rado for three sets
Sort
View
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
16 years 2 days ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz
FC
2003
Springer
101views Cryptology» more  FC 2003»
16 years 2 days ago
Fully Private Auctions in a Constant Number of Rounds
Abstract. We present a new cryptographic auction protocol that prevents extraction of bid information despite any collusion of participants. This requirement is stronger than commo...
Felix Brandt
HUC
2003
Springer
16 years 2 days ago
Evaluation of Visual Notification Cues for Ubiquitous Computing
With increased use of mobile information technology and increased amounts of information comes the need to simplify information presentation. This research considers whether low-in...
Peter Tarasewich, Christopher S. Campbell, Tian Xi...
HICSS
2002
IEEE
172views Biometrics» more  HICSS 2002»
15 years 11 months ago
Collaborative Software Development: A Discussion of Problem Solving Models and Groupware Technologies
Teamwork is always challenging. Adding the complication of problem solving and software design only amplifies this challenge. The challenges of developing software as a team can b...
Joanna DeFranco-Tommarello, Fadi P. Deek
ICECCS
2002
IEEE
79views Hardware» more  ICECCS 2002»
15 years 11 months ago
A Framework for Performability Modeling of Messaging Services in Distributed Systems
Messaging services are a useful component in distributed systems that require scalable dissemination of messages (events) from suppliers to consumers. These services decouple supp...
Srinivasan Ramani, Katerina Goseva-Popstojanova, K...