Sciweavers

3238 search results - page 77 / 648
» Not Enough Points Is Enough
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 2 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
EDBT
2009
ACM
170views Database» more  EDBT 2009»
14 years 2 months ago
Efficient constraint evaluation in categorical sequential pattern mining for trajectory databases
The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's po...
Leticia I. Gómez, Alejandro A. Vaisman
ESWS
2010
Springer
14 years 1 months ago
Scalable and Parallel Reasoning in the Semantic Web
Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...
Jacopo Urbani
CIVR
2004
Springer
184views Image Analysis» more  CIVR 2004»
14 years 1 months ago
Towards a Large Scale Concept Ontology for Broadcast Video
Earlier this year, a major effort was initiated to study the theoretical and empirical aspects of the automatic detection of semantic concepts in broadcast video, complementing ong...
Alexander G. Hauptmann
FMICS
2006
Springer
14 years 1 months ago
SAT-Based Verification of LTL Formulas
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Wenhui Zhang