Sciweavers

3146 search results - page 31 / 630
» Efficient Consequence Finding
Sort
View
AAAI
1993
13 years 11 months ago
Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
Michael J. Pazzani, Clifford Brunk
FCSC
2007
130views more  FCSC 2007»
13 years 9 months ago
An improved algorithm for finding community structure in networks with an application to IPv6 backbone network
The discovery of community structure in a large number of complex networks has attracted lots of interest in recent years. One category of algorithms for detecting community struct...
Yingxin Guo, Ke Xu
PRL
2008
122views more  PRL 2008»
13 years 9 months ago
Constraints for closest point finding
The traditional closest point criterion has been widely used for 3D free form shape matching, object recognition, internet search, computer graphics and medical imaging. However, ...
Yonghuai Liu
CHI
2003
ACM
14 years 10 months ago
Strategy hubs: next-generation domain portals with search procedures
Current search tools on the Web, such as general-purpose search engines (e.g. Google) and domain-specific portals (e.g. MEDLINEplus), do not provide search procedures that guide u...
Suresh K. Bhavnani, Christopher K. Bichakjian, Tim...
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 11 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar