Sciweavers

2027 search results - page 107 / 406
» Approximating power indices
Sort
View
MP
2010
149views more  MP 2010»
14 years 10 months ago
Copositive programming motivated bounds on the stability and the chromatic numbers
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
Igor Dukanovic, Franz Rendl
PAMI
2011
14 years 6 months ago
Product Quantization for Nearest Neighbor Search
— This paper introduces a product quantization based approach for approximate nearest neighbor search. The idea is to decomposes the space into a Cartesian product of low dimensi...
Hervé Jégou, Matthijs Douze, Cordeli...
PERVASIVE
2011
Springer
14 years 2 months ago
Using Decision-Theoretic Experience Sampling to Build Personalized Mobile Phone Interruption Models
We contribute a method for approximating users’ interruptibility costs to use for experience sampling and validate the method in an application that learns when to automatically ...
Stephanie Rosenthal, Anind K. Dey, Manuela M. Velo...
ICDE
2009
IEEE
219views Database» more  ICDE 2009»
16 years 1 months ago
Distance Oracles for Spatial Networks
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
Jagan Sankaranarayanan, Hanan Samet
ICC
2007
IEEE
15 years 6 months ago
ZigBee-based Intra-car Wireless Sensor Network
— Due to an increasing number of sensors deployed in cars, recently there is a growing interest in implementing a wireless sensor network within a car. In this paper, we report t...
Hsin-Mu Tsai, Cem U. Saraydar, Timothy Talty, Mich...