Sciweavers

551 search results - page 48 / 111
» The Complexity of Andersen's Analysis in Practice
Sort
View
PODS
2005
ACM
109views Database» more  PODS 2005»
15 years 12 months ago
XPath satisfiability in the presence of DTDs
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
Michael Benedikt, Wenfei Fan, Floris Geerts
ICDAR
2003
IEEE
15 years 5 months ago
Photo time-stamp detection and recognition
This paper addresses the problem of photo time-stamp detection and recognition, which is to determine the time a photo was taken. Since the time-stamp is exposed together with the...
Xiang-Rong Chen, HongJiang Zhang
CCCG
2008
15 years 1 months ago
Competitive Search for Longest Empty Intervals
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
Peter Damaschke
GRID
2006
Springer
14 years 11 months ago
Monitoring and analysing a Grid Middleware Node
Distributed Grid applications are becoming more and more popular as the use of complex grid middlewares becomes extensive, and more facilities are offered by these complex pieces o...
Ramon Nou, Ferran Julià, David Carrera, Kev...
MOBIHOC
2012
ACM
13 years 2 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn