Sciweavers

1707 search results - page 333 / 342
» A Computational Model for Arguments Understanding
Sort
View
KDD
2002
ACM
194views Data Mining» more  KDD 2002»
15 years 10 months ago
Scale Space Exploration For Mining Image Information Content
Images are highly complex multidimensional signals, with rich and complicated information content. For this reason they are difficult to analyze through a unique automated approach...
Mariana Ciucu, Patrick Héas, Mihai Datcu, J...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 10 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
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
15 years 9 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...
WISE
2009
Springer
15 years 6 months ago
Spectral Clustering in Social-Tagging Systems
Social tagging is an increasingly popular phenomenon with substantial impact on the way we perceive and understand the Web. For the many Web resources that are not self-descriptive...
Alexandros Nanopoulos, Hans-Henning Gabriel, Myra ...
WCRE
2009
IEEE
15 years 4 months ago
A Study of the Time Dependence of Code Changes
—Much of modern software development consists of building on older changes. Older periods provide the structure (e.g., functions and data types) on which changes in future period...
Omar Alam, Bram Adams, Ahmed E. Hassan