Sciweavers

4199 search results - page 500 / 840
» Generalizing Data in Natural Language
Sort
View
ICALP
1993
Springer
15 years 10 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
ICGI
2010
Springer
15 years 5 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà
MSV
2004
15 years 8 months ago
Correctness Criteria for Models' Validation- A Philosophical Perspective
Valid models are central to the existence of Computer science as in most other disciplines, but at what point can one say that a model is valid and hence correct? is often taken t...
Ijeoma Sandra Irobi, Johan Andersson, Anders Wall
KDD
2009
ACM
211views Data Mining» more  KDD 2009»
16 years 7 months ago
Address standardization with latent semantic association
Address standardization is a very challenging task in data cleansing. To provide better customer relationship management and business intelligence for customer-oriented cooperates...
Honglei Guo, Huijia Zhu, Zhili Guo, Xiaoxun Zhang,...
159
Voted
WWW
2005
ACM
16 years 7 months ago
CaTTS: calendar types and constraints for Web applications
Data referring to cultural calendars such as the widespread Gregorian dates but also dates after the Chinese, Hebrew, or Islamic calendars as well as data referring to professiona...
François Bry, Frank-André Rieß...