Sciweavers

666 search results - page 117 / 134
» New primal-dual algorithms for Steiner tree problems
Sort
View
IPPS
2002
IEEE
15 years 11 months ago
Parallel Incremental 2D-Discretization on Dynamic Datasets
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...
Srinivasan Parthasarathy, Arun Ramakrishnan
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 7 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen
KDD
2004
ACM
106views Data Mining» more  KDD 2004»
16 years 6 months ago
Early detection of insider trading in option markets
"Inside information" comes in many forms: knowledge of a corporate takeover, a terrorist attack, unexpectedly poor earnings, the FDA's acceptance of a new drug, etc...
Steve Donoho
PVLDB
2010
105views more  PVLDB 2010»
15 years 4 months ago
Destabilizers and Independence of XML Updates
Independence analysis is the problem of determining whether an update affects the result of a query, e.g. a constraint or materialized view. We develop a new, modular framework fo...
Michael Benedikt, James Cheney
EDBT
2008
ACM
120views Database» more  EDBT 2008»
16 years 6 months ago
Schema mapping verification: the spicy way
Schema mapping algorithms rely on value correspondences ? i.e., correspondences among semantically related attributes ? to produce complex transformations among data sources. Thes...
Angela Bonifati, Giansalvatore Mecca, Alessandro P...