Sciweavers

757 search results - page 150 / 152
» How to decide
Sort
View
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 6 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
IEAAIE
2010
Springer
13 years 5 months ago
Psychophysical Evaluation for a Qualitative Semantic Image Categorisation and Retrieval Approach
This paper details the behavioral evaluation of a qualitative image categorisation and retrieval approach using semantic features of images. Content based image retrieval and class...
Zia Ul-Qayyum, A. G. Cohn, Alexander Klippel
MASS
2010
173views Communications» more  MASS 2010»
13 years 5 months ago
Efficient routing in delay tolerant networks with correlated node mobility
Abstract--In a delay tolerant network (DTN), nodes are connected intermittently and the future node connections are mostly unknown. Since in these networks, a fully connected path ...
Eyuphan Bulut, Sahin Cem Geyik, Boleslaw K. Szyman...
QEST
2010
IEEE
13 years 5 months ago
Timed Branching Processes
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...
Ashutosh Trivedi, Dominik Wojtczak
CONEXT
2009
ACM
13 years 5 months ago
Lockr: better privacy for social networks
Today's online social networking (OSN) sites do little to protect the privacy of their users' social networking information. Given the highly sensitive nature of the inf...
Amin Tootoonchian, Stefan Saroiu, Yashar Ganjali, ...