Sciweavers

1055 search results - page 183 / 211
» Enumerations in computable structure theory
Sort
View
ACL
1994
13 years 9 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick
AO
2007
119views more  AO 2007»
13 years 8 months ago
The model of roles within an ontology development tool: Hozo
One of the major goals of ontology is to represent properly the underlying conceptual structure of the messy world reflecting the reality as much as possible. Ontology building to...
Riichiro Mizoguchi, Eiichi Sunagawa, Kouji Kozaki,...
DM
2006
128views more  DM 2006»
13 years 7 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
CSCW
2002
ACM
13 years 7 months ago
A Descriptive Framework of Workspace Awareness for Real-Time Groupware
Supporting awareness of others is an idea that holds promise for improving the usability of real-time distributed groupware. However, there is little principled information availa...
Carl Gutwin, Saul Greenberg
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 8 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu