Sciweavers

10182 search results - page 1619 / 2037
» Case Studies
Sort
View
EDBT
2004
ACM
155views Database» more  EDBT 2004»
16 years 7 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
162
Voted
EDBT
2008
ACM
122views Database» more  EDBT 2008»
16 years 7 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
ICFP
2006
ACM
16 years 7 months ago
Design patterns as higher-order datatype-generic programs
Design patterns are reusable abstractions in object-oriented software. However, using current mainstream programming languages, these elements can only be expressed extra-linguist...
Jeremy Gibbons
PERCOM
2007
ACM
16 years 6 months ago
Static Path Planning for Mobile Beacons to Localize Sensor Networks
In this paper, we study the static path planning problem with wireless sensor network localization as the primary objective. We consider a model in which sensors are assumed to be...
Rui Huang, Gergely V. Záruba
MOBISYS
2007
ACM
16 years 6 months ago
Simplifying cyber foraging for mobile devices
Cyber foraging is the transient and opportunistic use of compute servers by mobile devices. The short market life of such devices makes rapid modification of applications for remo...
Rajesh Krishna Balan, Darren Gergle, Mahadev Satya...
« Prev « First page 1619 / 2037 Last » Next »