Sciweavers

4940 search results - page 642 / 988
» On the Complexity of Universal Programs
Sort
View
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
16 years 6 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
EDBT
2002
ACM
125views Database» more  EDBT 2002»
16 years 6 months ago
Estimating Answer Sizes for XML Queries
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
16 years 6 months ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
Andrey Balmin, Emiran Curtmola
EUROSYS
2007
ACM
16 years 3 months ago
Macroprogramming heterogeneous sensor networks using cosmos
In this paper, we present COSMOS, a novel architecture for macroprogramming heterogeneous sensor network systems. Macroprogramming entails aggregate system behavior specification...
Asad Awan, Suresh Jagannathan, Ananth Grama
CCS
2009
ACM
16 years 1 months ago
Keep your friends close: the necessity for updating an anomaly sensor with legitimate environment changes
Large-scale distributed systems have dense, complex code-bases that are assumed to perform multiple and inter-dependent tasks while user interaction is present. The way users inte...
Angelos Stavrou, Gabriela F. Cretu-Ciocarlie, Mich...