2503 search results - page 149 / 501 » A study of 3-arc graphs |
191
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
189
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
182
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
179
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
203
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...