Sciweavers

3656 search results - page 64 / 732
» Compact Location Problems
Sort
View
ASAP
2007
IEEE
116views Hardware» more  ASAP 2007»
13 years 11 months ago
The Design of a Novel Object-oriented Processor : OOMIPS
A novel object-oriented processor is proposed in this paper, which provides support for object addressing, message passing and dynamic memory management. Object running on this pr...
Weixing Ji, Feng Shi, Baojun Qiao, Muhammad Kamran
CPHYSICS
2007
87views more  CPHYSICS 2007»
13 years 10 months ago
HEP computing in Korea
The current status of High Energy Physics (HEP) computing system and plan of HEP data grid in Korea are reported. The main infrastructure is located at the Center for High Energy ...
Dongchul Son, Jun-Suhk Suh
COLING
2010
13 years 4 months ago
Have2eat: a Restaurant Finder with Review Summarization for Mobile Phones
Have2eat is a popular mobile application available for iPhone and Android-based devices that helps users to find and assess nearby restaurants. It lists restaurants located around...
Giuseppe Fabbrizio, Narendra Gupta, Sveva Besana, ...
IJCGA
2010
99views more  IJCGA 2010»
13 years 8 months ago
Finding All Door Locations that Make a Room Searchable
—A room is a simple polygon with a prespecified point, called the door, on its boundary. Search may be conducted by two guards on the boundary who keep mutual visibility at all ...
Tsunehiko Kameda, John Z. Zhang
SIGECOM
2003
ACM
92views ECommerce» more  SIGECOM 2003»
14 years 3 months ago
Strategyproof cost-sharing mechanisms for set cover and facility location games
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
Nikhil R. Devanur, Milena Mihail, Vijay V. Vaziran...