Sciweavers

966 search results - page 149 / 194
» Small Alliances in Graphs
Sort
View
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
14 years 3 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
ICDE
2009
IEEE
126views Database» more  ICDE 2009»
14 years 3 months ago
Querying Communities in Relational Databases
— Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is speci...
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao
ICRA
2009
IEEE
164views Robotics» more  ICRA 2009»
14 years 3 months ago
Assigning cameras to subjects in video surveillance systems
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
Hazem El-Alfy, David Jacobs, Larry Davis
AGILE
2009
Springer
210views GIS» more  AGILE 2009»
14 years 3 months ago
Detecting Hotspots in Geographic Networks
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
Kevin Buchin, Sergio Cabello, Joachim Gudmundsson,...
MDM
2009
Springer
123views Communications» more  MDM 2009»
14 years 3 months ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...