Sciweavers

11395 search results - page 2003 / 2279
» Beyond computer science
Sort
View
MFCS
2004
Springer
16 years 1 days ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
John M. Hitchcock, María López-Vald&...
MFCS
2004
Springer
16 years 1 days ago
Complexity of Decision Problems for Simple Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Wim Martens, Frank Neven, Thomas Schwentick
OOPSLA
2004
Springer
16 years 1 days ago
Notes on notes on postmodern programming: radio edit
These notes have the status of letters written to ourselves: we wrote them down because, without doing so, we found ourselves making rguments over and over again. So began the abs...
James Noble, Robert Biddle
WEBI
2004
Springer
16 years 22 hour ago
An Integrated Approach to Discovery in Complex Information Spaces
As the amount of available data continues to increase, more and more effective means for discovering important patterns and relationships within that data are required. Although t...
Daryl H. Hepting, Cory J. Butz
WEBI
2004
Springer
16 years 22 hour ago
TSSP: A Reinforcement Algorithm to Find Related Papers
Content analysis and citation analysis are two common methods in recommending system. Compared with content analysis, citation analysis can discover more implicitly related papers...
Shen Huang, Gui-Rong Xue, Benyu Zhang, Zheng Chen,...
« Prev « First page 2003 / 2279 Last » Next »