Sciweavers

4560 search results - page 578 / 912
» Finding Data in the Neighborhood
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 7 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
16 years 7 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 7 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
ICSE
2005
IEEE-ACM
16 years 6 months ago
Predictors of customer perceived software quality
Predicting software quality as perceived by a customer may allow an organization to adjust deployment to meet the quality expectations of its customers, to allocate the appropriat...
Audris Mockus, Ping Zhang, Paul Luo Li
196
Voted
MOBIHOC
2008
ACM
16 years 6 months ago
Routing performance analysis of human-driven delay tolerant networks using the truncated levy walk model
The routing performance of delay tolerant networks (DTN) is highly correlated with the distribution of inter-contact times (ICT), the time period between two successive contacts o...
Seongik Hong, Injong Rhee, Seong Joon Kim, Kyungha...