Sciweavers

5022 search results - page 759 / 1005
» Data structures and problem solving using Java
Sort
View
122
Voted
COGSR
2011
105views more  COGSR 2011»
14 years 9 months ago
Inductive rule learning on the knowledge level
We present an application of the analytical inductive programming system Igor to learning sets of recursive rules from positive experience. We propose that this approach can be us...
Ute Schmid, Emanuel Kitzelmann
123
Voted
SIAMDM
2010
101views more  SIAMDM 2010»
14 years 9 months ago
Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents
Inspired by the convex program of Eisenberg and Gale which captures Fisher markets with linear utilities, Jain and Vazirani [STOC, 2007] introduced the class of EisenbergGale (EG)...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....
162
Voted
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
15 years 8 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
143
Voted
ACL
2008
15 years 4 months ago
Exploiting Feature Hierarchy for Transfer Learning in Named Entity Recognition
We present a novel hierarchical prior structure for supervised transfer learning in named entity recognition, motivated by the common structure of feature spaces for this task acr...
Andrew Arnold, Ramesh Nallapati, William W. Cohen
149
Voted
JGAA
2007
135views more  JGAA 2007»
15 years 2 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento