Sciweavers

844 search results - page 118 / 169
» Semantic Analysis of Matrix Structures
Sort
View
WWW
2007
ACM
16 years 4 months ago
Hierarchical, perceptron-like learning for ontology-based information extraction
Recent work on ontology-based Information Extraction (IE) has tried to make use of knowledge from the target ontology in order to improve semantic annotation results. However, ver...
Yaoyong Li, Kalina Bontcheva
237
Voted
POPL
2004
ACM
16 years 3 months ago
Tridirectional typechecking
In prior work we introduced a pure type assignment system that encompasses a rich set of property types, including intersections, unions, and universally and existentially quantif...
Joshua Dunfield, Frank Pfenning
SIGMOD
2009
ACM
139views Database» more  SIGMOD 2009»
16 years 3 months ago
Vispedia: on-demand data integration for interactive visualization and exploration
Wikipedia is an example of the large, collaborative, semi-structured data sets emerging on the Web. Typically, before these data sets can be used, they must transformed into struc...
Bryan Chan, Justin Talbot, Leslie Wu, Nathan Sakun...
129
Voted
LCTRTS
2010
Springer
15 years 10 months ago
Versatile system-level memory-aware platform description approach for embedded MPSoCs
In this paper, we present a novel system modeling language which targets primarily the development of source-level multiprocessor memory aware optimizations. In contrast to previo...
Robert Pyka, Felipe Klein, Peter Marwedel, Stylian...
FPCA
1995
15 years 7 months ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein