Sciweavers

943 search results - page 51 / 189
» How should data structures and algorithms be taught
Sort
View
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
15 years 1 months ago
A framework for specifying explicit bias for revision of approximate information extraction rules
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...
Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, ...
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
14 years 11 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
KDID
2004
132views Database» more  KDID 2004»
14 years 11 months ago
An Automata Approach to Pattern Collections
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
WEBDB
2004
Springer
79views Database» more  WEBDB 2004»
15 years 3 months ago
Scalable Dissemination: What's Hot and What's Not
A major problem in web database applications and on the Internet in general is the scalable delivery of data. One proposed solution for this problem is a hybrid system that uses m...
Jonathan Beaver, Nicholas Morsillo, Kirk Pruhs, Pa...
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
15 years 3 months ago
COSMO: a correlation sensitive mutation operator for multi-objective optimization
This contribution is the first to discover exploitable structural features within circuit optimization problems (COP) and discuss how it is indicative of a general structure and ...
Varun Aggarwal, Una-May O'Reilly