Sciweavers

2446 search results - page 425 / 490
» Characterizing the Performance of
Sort
View
PLDI
2012
ACM
12 years 19 days ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
12 years 18 days ago
Learning from crowds in the presence of schools of thought
Crowdsourcing has recently become popular among machine learning researchers and social scientists as an effective way to collect large-scale experimental data from distributed w...
Yuandong Tian, Jun Zhu
TON
2012
12 years 18 days ago
A Game-Theoretic Approach to Anonymous Networking
—Anonymous wireless networking is studied when an adversary monitors the transmission timing of an unknown subset of the network nodes. For a desired quality of service (QoS), as...
Parvathinathan Venkitasubramaniam, Lang Tong
MOBISYS
2008
ACM
14 years 9 months ago
Sixthsense: rfid-based enterprise intelligence
RFID is widely used to track the movement of goods through a supply chain. In this paper, we extend the domain of RFID by presenting SixthSense, a platform for RFID-based enterpri...
Lenin Ravindranath, Venkata N. Padmanabhan, Piyush...
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
14 years 5 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...