Sciweavers

3133 search results - page 527 / 627
» Representing clusters for retrieval
Sort
View
VLDB
2008
ACM
140views Database» more  VLDB 2008»
16 years 6 months ago
Efficient temporal counting with bounded error
This paper studies aggregate search in transaction time databases. Specifically, each object in such a database can be modeled as a horizontal segment, whose y-projection is its s...
Yufei Tao, Xiaokui Xiao
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
16 years 6 months ago
Identifying meaningful return information for XML keyword search
Keyword search enables web users to easily access XML data without the need to learn a structured query language and to study possibly complex data schemas. Existing work has addr...
Ziyang Liu, Yi Chen
ICIAP
2003
ACM
16 years 6 months ago
Old fashioned state-of-the-art image classification
In this paper we present a statistical learning scheme for image classification based on a mixture of old fashioned ideas and state of the art learning tools. We represent input i...
Annalisa Barla, Francesca Odone, Alessandro Verri
IPSN
2010
Springer
16 years 1 months ago
Programming storage-centric sensor networks with Squirrel
We present SQUIRREL, a stream-oriented programming framework for storage-centric sensor networks. The storagecentric paradigm—where storage operations prevail over communication...
Luca Mottola
SAC
2009
ACM
16 years 1 months ago
Runtime monitoring of web service choreographies using streaming XML
A wide range of web service choreography constraints on the content and sequentiality of messages can be translated into Linear Temporal Logic (LTL). Although they can be statical...
Sylvain Hallé, Roger Villemaire