1055 search results - page 91 / 211 » Enumerations in computable structure theory |
122
click to vote
JSYML
2008
15 years 4 months ago
2008
In 2004 Csima, Hirschfeldt, Knight, and Soare [1] showed that a set A T 0 is nonlow2 if and only if A is prime bounding, i.e. for every complete atomic decidable theory T , there i...
185
click to vote
ICCVW
1999
Springer
15 years 8 months ago
1999
Springer
This paper is a survey of the theory and methods of photogrammetric bundle adjustment, aimed at potential implementors in the computer vision community. Bundle adjustment is the p...
150
click to vote
CACM
1998
15 years 4 months ago
1998
The long range goal of the “Virtual Design Team” (VDT) research program is to develop computational tools to analyze decision making and communication behavior and thereby to ...
121
click to vote
CHI
2010
ACM
15 years 11 months ago
2010
ACM
Relations between users on social media sites often reflect a mixture of positive (friendly) and negative (antagonistic) interactions. In contrast to the bulk of research on soci...
111
click to vote
ISVD
2007
IEEE
15 years 10 months ago
2007
IEEE
We introduce the use of weighted medial graph structures to represent sounds and musical events. Such structures permit the building of hierarchical neighborhood relationships (sy...