Sciweavers

2150 search results - page 100 / 430
» On a restricted cross-intersection problem
Sort
View
ATMOS
2010
134views Optimization» more  ATMOS 2010»
15 years 3 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
WWW
2008
ACM
16 years 5 months ago
Privacy-enhanced sharing of personal content on the web
Publishing personal content on the web is gaining increased popularity with dramatic growth in social networking websites, and availability of cheap personal domain names and host...
Mohammad Mannan, Paul C. van Oorschot
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
15 years 10 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
112
Voted
PODS
2008
ACM
129views Database» more  PODS 2008»
16 years 4 months ago
Tree-width and functional dependencies in databases
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
Isolde Adler
EDBT
2008
ACM
122views Database» more  EDBT 2008»
16 years 4 months ago
Mining all frequent projection-selection queries from a relational table
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos