Sciweavers

93 search results - page 16 / 19
» Hard constraint satisfaction problems have hard gaps at loca...
Sort
View
KDD
2009
ACM
269views Data Mining» more  KDD 2009»
14 years 5 months ago
Extracting discriminative concepts for domain adaptation in text mining
One common predictive modeling challenge occurs in text mining problems is that the training data and the operational (testing) data are drawn from different underlying distributi...
Bo Chen, Wai Lam, Ivor Tsang, Tak-Lam Wong
IPSN
2009
Springer
13 years 12 months ago
Simultaneous placement and scheduling of sensors
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlo...
SIN
2010
ACM
13 years 3 months ago
Analysis of privacy in online social networks of runet
In recent years, social networking sites (SNSs) gained high popularity among Internet users as they combine the best of both worlds: befriending people outside real life situation...
Slava Kisilevich, Florian Mansmann
AIPS
2008
13 years 7 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
13 years 11 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi