Sciweavers

182 search results - page 32 / 37
» Some problems with the notion of context-aware computing
Sort
View
FUIN
2008
83views more  FUIN 2008»
13 years 7 months ago
Fault Diagnosis with Static and Dynamic Observers
We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in t...
Franck Cassez, Stavros Tripakis
PVLDB
2010
92views more  PVLDB 2010»
13 years 5 months ago
Proximity Rank Join
We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature...
Davide Martinenghi, Marco Tagliasacchi
FOCS
2010
IEEE
13 years 5 months ago
Stability Yields a PTAS for k-Median and k-Means Clustering
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
Pranjal Awasthi, Avrim Blum, Or Sheffet
WS
2005
ACM
14 years 1 months ago
A framework for MAC protocol misbehavior detection in wireless networks
The pervasiveness of wireless devices and the architectural organization of wireless networks in distributed communities, where no notion of trust can be assumed, are the main rea...
Svetlana Radosavac, John S. Baras, Iordanis Koutso...
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
14 years 1 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen