Sciweavers

10493 search results - page 211 / 2099
» Dynamic Word Problems
Sort
View
ANLP
2000
141views more  ANLP 2000»
13 years 9 months ago
Aggressive Morphology for Robust Lexical Coverage
This paper describes an approach to providing lexical information for natural language processing in unrestricted domains. A system of approximately 1200 morphological rules is us...
William A. Woods
ACCV
2009
Springer
14 years 2 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee
ICEB
2004
297views Business» more  ICEB 2004»
13 years 9 months ago
Security Measures in Mobile Commerce: Problems and Solutions
Due to the advent of the Internet, electronic business transactions have exploded around the globe. Along with the Internet, wireless technology has exponentially developed as wel...
Sanwar Ali, Waleed Farag, Mohammad A. Rob
AO
2007
80views more  AO 2007»
13 years 8 months ago
Problems in the ontology of computer programs
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...
Amnon H. Eden, Raymond Turner
COGSCI
2010
75views more  COGSCI 2010»
13 years 8 months ago
Moral Principles or Consumer Preferences? Alternative Framings of the Trolley Problem
We created paired moral dilemmas with minimal contrasts in wording, a research strategy that has been advocated as a way to empirically establish principles operative in a domain-...
Tage S. Rai, Keith J. Holyoak