Sciweavers

9849 search results - page 1755 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
CADE
2001
Springer
16 years 6 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
VLDB
2007
ACM
131views Database» more  VLDB 2007»
16 years 6 months ago
Dissemination of compressed historical information in sensor networks
Sensor nodes are small devices that "measure" their environment and communicate feeds of low-level data values to a base station for further processing and archiving. Dis...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
16 years 6 months ago
Estimating the confidence of conditional functional dependencies
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...
Graham Cormode, Lukasz Golab, Flip Korn, Andrew Mc...
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
16 years 6 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 6 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
« Prev « First page 1755 / 1970 Last » Next »