Sciweavers

868 search results - page 120 / 174
» A general compression algorithm that supports fast searching
Sort
View
KDD
2006
ACM
139views Data Mining» more  KDD 2006»
14 years 9 months ago
Generating semantic annotations for frequent patterns with context analysis
As a fundamental data mining task, frequent pattern mining has widespread applications in many different domains. Research in frequent pattern mining has so far mostly focused on ...
Qiaozhu Mei, Dong Xin, Hong Cheng, Jiawei Han, Che...
ICSE
2008
IEEE-ACM
14 years 9 months ago
LISABETH: automated content-based signature generator for zero-day polymorphic worms
Modern worms can spread so quickly that any countermeasure based on human reaction might not be fast enough. Recent research has focused on devising algorithms to automatically pr...
Lorenzo Cavallaro, Andrea Lanzi, Luca Mayer, Matti...
AICOM
2004
100views more  AICOM 2004»
13 years 9 months ago
Query rewriting with symmetric constraints
Abstract. We address the problem of answering queries using expressive symmetric inter-schema constraints which allow to establish mappings between several heterogeneous informatio...
Christoph Koch
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
14 years 2 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
TOG
2002
107views more  TOG 2002»
13 years 8 months ago
Synthesis of bidirectional texture functions on arbitrary surfaces
The bidirectional texture function (BTF) is a 6D function that can describe textures arising from both spatially-variant surface reflectance and surface mesostructures. In this pa...
Xin Tong, Jingdan Zhang, Ligang Liu, Xi Wang, Bain...