Sciweavers

12193 search results - page 17 / 2439
» It's not all about
Sort
View
ACL
2008
13 years 8 months ago
Computing Confidence Scores for All Sub Parse Trees
Computing confidence scores for applications, such as dialogue system, information retrieving and extraction, is an active research area. However, its focus has been primarily on ...
Feng Lin, Fuliang Weng
IPL
2000
69views more  IPL 2000»
13 years 6 months ago
Generating all maximal models of a Boolean expression
We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an e...
Dimitris J. Kavvadias, Martha Sideri, Elias C. Sta...
NDJFL
1998
81views more  NDJFL 1998»
13 years 6 months ago
An Undecidable Linear Order That Is n-Decidable for All n
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
John Chisholm, Michael Moses
IJCGA
2010
99views more  IJCGA 2010»
13 years 5 months ago
Finding All Door Locations that Make a Room Searchable
—A room is a simple polygon with a prespecified point, called the door, on its boundary. Search may be conducted by two guards on the boundary who keep mutual visibility at all ...
Tsunehiko Kameda, John Z. Zhang
ICCHP
2010
Springer
13 years 5 months ago
Synote: Accessible and Assistive Technology Enhancing Learning for All Students
Abstract. Although manual transcription and captioning can increase the accessibility of multimedia for deaf students it is rarely provided in educational contexts in the UK due to...
Mike Wald