Sciweavers

943 search results - page 99 / 189
» How should data structures and algorithms be taught
Sort
View
KDD
2005
ACM
92views Data Mining» more  KDD 2005»
14 years 9 months ago
Summarizing itemset patterns: a profile-based approach
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
Xifeng Yan, Hong Cheng, Jiawei Han, Dong Xin
WWW
2011
ACM
13 years 4 months ago
Generalized fact-finding
Once information retrieval has located a document, and information extraction has provided its contents, how do we know whether we should actually believe it? Fact-finders are a ...
Jeff Pasternack, Dan Roth
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
14 years 9 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
LREC
2008
138views Education» more  LREC 2008»
13 years 10 months ago
Bridging the Gap between Linguists and Technology Developers: Large-Scale, Sociolinguistic Annotation for Dialect and Speaker Re
Recent years have seen increased interest within the speaker recognition community in high-level features including, for example, lexical choice, idiomatic expressions or syntacti...
Christopher Cieri, Stephanie Strassel, Meghan Lamm...
RSCTC
2000
Springer
197views Fuzzy Logic» more  RSCTC 2000»
14 years 27 days ago
Rough Set Approach to CBR
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
Jan Wierzbicki