Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
4,532
Shtolo -- Converting STEP Short Listings to Annotated Listings
- Server, Proceedings of First International Workshop on Services in Distributed and Networked Environments (SDNE
, 1993
"... A STEP Application Protocol includes an AIM EXPRESS Annotated Listing. An Annotated Listing is created by combining the Short Listing and any objects from STEP Integrated Resource Parts that are referenced from the Short Listing either directly or indirectly. A number of transformations are performe ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
A STEP Application Protocol includes an AIM EXPRESS Annotated Listing. An Annotated Listing is created by combining the Short Listing and any objects from STEP Integrated Resource Parts that are referenced from the Short Listing either directly or indirectly. A number of transformations
Shtolo -- Converting STEP Short Listings to Annotated Listings
, 1993
"... A STEP Application Protocol includes an AIM EXPRESS Annotated Listing. An Annotated Listing is created by combining the Short Listing and any objects from STEP Integrated Resource Parts that are referenced from the Short Listing either directly or indirectly. A number of transformations are performe ..."
Abstract
- Add to MetaCart
A STEP Application Protocol includes an AIM EXPRESS Annotated Listing. An Annotated Listing is created by combining the Short Listing and any objects from STEP Integrated Resource Parts that are referenced from the Short Listing either directly or indirectly. A number of transformations
Review Resumes and Short list Candidates
"... /update/create / with assistance from HR HR – review/seek clarification if required ..."
Abstract
- Add to MetaCart
/update/create / with assistance from HR HR – review/seek clarification if required
SHORT LISTS FOR SHORTEST DESCRIPTIONS IN SHORT TIME
, 2013
"... Abstract. Is it possible to find a shortest description for a binary string? The well-known answer is “no, Kolmogorov complexity is not computable. ” Faced with this barrier, one might instead seek a short list of candidates which includes a laconic description. Remarkably such approximations exist. ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Abstract. Is it possible to find a shortest description for a binary string? The well-known answer is “no, Kolmogorov complexity is not computable. ” Faced with this barrier, one might instead seek a short list of candidates which includes a laconic description. Remarkably such approximations exist
An adaptive short list for documents on the world wide web
- In Proceedings of the 1997 International Conference on Intelligent User Interfaces, 209--211
, 1997
"... Since the World Wide Web (WWW) is so popular and growing so quickly, users have almost an intinite number of sites to choose from. Bookmark features in web browsers allow users to easily record the sites that they would like to be able to view again, without having to repeatedly search through the W ..."
Abstract
-
Cited by 15 (1 self)
- Add to MetaCart
the WWW. However, bookmark lists for active web users can grow very long very quickly. Since usermaintained bookmark lists can easily grow long and somewhat harder to use, it is usefil to have an automatically maintained shorter list of useful sites. This paper describes an Adaptive Short List of commonly
Short lists with short programs in short time
"... Given a machine U, a c-short program for x is a string p such that U(p) = x and the length of p is bounded by c + (the length of a shortest program for x). We show that for any universal machine, it is possible to compute in polynomial time on input x a list of polynomial size guaranteed to contai ..."
Abstract
-
Cited by 6 (5 self)
- Add to MetaCart
Given a machine U, a c-short program for x is a string p such that U(p) = x and the length of p is bounded by c + (the length of a shortest program for x). We show that for any universal machine, it is possible to compute in polynomial time on input x a list of polynomial size guaranteed
Some studies in machine learning using the game of Checkers
- IBM JOURNAL OF RESEARCH AND DEVELOPMENT
, 1959
"... Two machine-learning procedures have been investigated in some detail using the game of checkers. Enough work has been done to verify the fact that a computer can be programmed so that it will learn to play a better game of checkers than can be played by the person who wrote the program. Furthermor ..."
Abstract
-
Cited by 780 (0 self)
- Add to MetaCart
. Furthermore, it can learn to do this in a remarkably short period of time (8 or 10 hours of machine-playing time) when given only the rules of the game, a sense of direction, and a redundant and incomplete list of parameters which are thought to have something to do with the game, but whose correct signs
Building a Lightweight Semantic Model for Unsupervised Information Extraction on Short Listings
"... Short listings such as classified ads or product listings abound on the web. If a computer can reliably extract information from them, it will greatly benefit a variety of applications. Short listings are, however, challenging to process due to their informal styles. In this paper, we present an uns ..."
Abstract
- Add to MetaCart
Short listings such as classified ads or product listings abound on the web. If a computer can reliably extract information from them, it will greatly benefit a variety of applications. Short listings are, however, challenging to process due to their informal styles. In this paper, we present
Results 1 - 10
of
4,532
