Sciweavers

481 search results - page 75 / 97
» Martin's game: a lower bound for the number of sets
Sort
View
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
14 years 1 months ago
Finding Top-k Similar Pairs of Objects Annotated with Terms from an Ontology
With the growing focus on semantic searches and interpretations, an increasing number of standardized vocabularies and ontologies are being designed and used to describe data. We ...
Arnab Bhattacharya, Abhishek Bhowmick, Ambuj K. Si...
ACSAC
2010
IEEE
13 years 12 days ago
A quantitative analysis of the insecurity of embedded network devices: results of a wide-area scan
We present a quantitative lower bound on the number of vulnerable embedded device on a global scale. Over the past year, we have systematically scanned large portions of the inter...
Ang Cui, Salvatore J. Stolfo
INFOCOM
2011
IEEE
13 years 4 days ago
General capacity scaling of wireless networks
—We study the general scaling laws of the capacity for random wireless networks under the generalized physical model. The generality of this work is embodied in three dimensions ...
Cheng Wang, Changjun Jiang, Xiang-Yang Li, ShaoJie...
COMPGEOM
2007
ACM
14 years 20 days ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...
SPAA
2009
ACM
14 years 9 months ago
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs