Sciweavers

2487 search results - page 338 / 498
» Partitions of Graphs into Trees
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
CCS
2009
ACM
14 years 3 months ago
Large-scale malware indexing using function-call graphs
A major challenge of the anti-virus (AV) industry is how to effectively process the huge influx of malware samples they receive every day. One possible solution to this problem i...
Xin Hu, Tzi-cker Chiueh, Kang G. Shin
ICDE
2009
IEEE
216views Database» more  ICDE 2009»
13 years 6 months ago
Continuous Subgraph Pattern Search over Graph Streams
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
Changliang Wang, Lei Chen 0002

Publication
262views
15 years 18 days ago
Attribute Multiset Grammars for Global Explanations of Activities
Recognizing multiple interleaved activities in a video requires implicitly partitioning the detections for each activity. Furthermore, constraints between activities are important ...
Dima Damen, David Hogg
ICIP
2007
IEEE
14 years 10 months ago
Perceptual Image Coding Based on a Maximum of Minimal Structural Similarity Criterion
Perceptual image coding algorithms typically impose perceptual modeling in a preprocessing stage. A perceptual normalization model is often used to transform the original image si...
Zhou Wang, Qiang Li, Xinli Shang