Sciweavers

1047 search results - page 95 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
13 years 11 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
13 years 5 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
GECCO
2005
Springer
113views Optimization» more  GECCO 2005»
14 years 1 months ago
Search-based mutation testing for Simulink models
The efficient and effective generation of test-data from high-level models is of crucial importance in advanced modern software engineering. Empirical studies have shown that muta...
Yuan Zhan, John A. Clark
AIPS
2006
13 years 9 months ago
Durative Planning in HTNs
This paper provides techniques for hierarchical task network (HTN) planning with durative actions. HTNs can provide useful heuristic guidance to planners, express goals that canno...
Robert P. Goldman
ICDE
2009
IEEE
216views Database» more  ICDE 2009»
13 years 5 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