Sciweavers

904 search results - page 171 / 181
» Query Graph Visualizer: A Collaborative Querying System
Sort
View
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
16 years 5 days ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos
MIDDLEWARE
2007
Springer
15 years 5 months ago
A piggybacking approach to reduce overhead in sensor network gossiping
Many wireless sensor network protocols are employing gossipbased message dissemination, where nodes probabilistically forward messages, to reduce message overhead. We are concerne...
Ercan Ucan, Nathanael Thompson, Indranil Gupta
PLDI
2004
ACM
15 years 5 months ago
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
John Whaley, Monica S. Lam
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
15 years 12 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
ATMOS
2008
139views Optimization» more  ATMOS 2008»
15 years 1 months ago
Efficient On-Trip Timetable Information in the Presence of Delays
Abstract. The search for train connections in state-of-the-art commercial timetable information systems is based on a static schedule. Unfortunately, public transportation systems ...
Lennart Frede, Matthias Müller-Hannemann, Mat...