Sciweavers

661 search results - page 116 / 133
» Combining Information using Hard Constraints
Sort
View
105
Voted
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
15 years 5 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
GIS
2003
ACM
16 years 1 months ago
The internet spatial spreadsheet: enabling remote visualization of dynamic spatial data and ongoing query results over a network
Moving object databases store and process data for objects that change location frequently. Materialized views maintained over time must be updated to reflect changes due to the m...
Glenn S. Iwerks, Hanan Samet
110
Voted
WWW
2009
ACM
16 years 1 months ago
Quicklink selection for navigational query results
Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page, and that let the users directly jump to selected points inside t...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
90
Voted
SOSP
2003
ACM
15 years 9 months ago
Samsara: honor among thieves in peer-to-peer storage
Peer-to-peer storage systems assume that their users consume resources in proportion to their contribution. Unfortunately, users are unlikely to do this without some enforcement m...
Landon P. Cox, Brian D. Noble
ANCS
2006
ACM
15 years 6 months ago
WormTerminator: an effective containment of unknown and polymorphic fast spreading worms
The fast spreading worm is becoming one of the most serious threats to today’s networked information systems. A fast spreading worm could infect hundreds of thousands of hosts w...
Songqing Chen, Xinyuan Wang, Lei Liu, Xinwen Zhang