Sciweavers

6618 search results - page 936 / 1324
» Natural Logic for Natural Language
Sort
View
SOCIALCOM
2010
15 years 5 months ago
Using Text Analysis to Understand the Structure and Dynamics of the World Wide Web as a Multi-Relational Graph
A representation of the World Wide Web as a directed graph, with vertices representing web pages and edges representing hypertext links, underpins the algorithms used by web search...
Harish Sethu, Alexander Yates
SBP
2011
Springer
15 years 2 months ago
Using Web-Based Knowledge Extraction Techniques to Support Cultural Modeling
The World Wide Web is a potentially valuable source of information about the cognitive characteristics of cultural groups. However, attempts to use the Web in the context of cultur...
Paul R. Smart, Winston R. Sieck, Nigel R. Shadbolt
CHI
2006
ACM
16 years 8 months ago
Answering why and why not questions in user interfaces
Modern applications such as Microsoft Word have many automatic features and hidden dependencies that are frequently helpful but can be mysterious to both novice and expert users. ...
Brad A. Myers, David A. Weitzman, Andrew Jensen Ko...
FM
2009
Springer
124views Formal Methods» more  FM 2009»
16 years 2 months ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry
CP
2004
Springer
16 years 1 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore