ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (1,687)
  • Computer Science  (1,687)
Collection
  • Articles  (1,687)
Source
Keywords
Publisher
Years
Journal
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Characterizing and recognizing the visibility graph of a funnel-shaped polygon (1995)
    Springer
    Algorithmica 14 (1995), S. 27-51 
    Details
    ISSN: 1432-0541
    Keywords: Computational geometry ; Funnel-shaped polygon ; Visibility graph ; Characterizing and recognizing visibility graphs ; Weakly triangulated graph ; Perfect graph
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A funnel, which is notable for its fundamental role in visibility algorithms, is defined as a polygon that has exactly three convex vertices, two of which are connected by a boundary edge. In this paper we investigate the visibility graph of a funnel which we call an F-graph. We first present two characterizations of an F-graph, one of whose sufficiency proof itself is a linear time Real RAM algorithm for drawing a funnel on the plane that corresponds to an F-graph. We next give a linear-time algorithm for recognizing an F-graph. When the algorithm recognizes an F-graph, it also reports one of the Hamiltonian cycles defining the boundary of its corresponding funnel. This recognition algorithm takes linear time even on a RAM. We finally show that an F-graph is weakly triangulated and therefore perfect, which agrees with the fact that perfect graphs are related to geometric structures.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01300372
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Linear-Time Algorithms for Finding the Shadow Volumes from a Convex Area Light Source (1998)
    Springer
    Algorithmica 20 (1998), S. 227-241 
    Details
    ISSN: 1432-0541
    Keywords: Key words. Computational geometry, Penumbra, Umbra, Computer graphics.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. An area light source in three-dimensional space shines past a scene polygon to generate two types of shadow volumes for each scene polygon, i.e., one with partial occlusion and the other with complete occlusion. These are called penumbra and umbra, respectively. In this paper we propose linear-time algorithms for computing the penumbra and the umbra of a scene polygon from an area light source, respectively.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/PL00009194
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Efficient Algorithms for Computing a Complete Visibility Region in Three-Dimensional Space (1998)
    Springer
    Algorithmica 20 (1998), S. 201-225 
    Details
    ISSN: 1432-0541
    Keywords: Key words. Computational geometry, Complete visibility, Penumbra.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. Given a set P of polygons in three-dimensional space, two points p and q are said to be visible from each other with respect to P if the line segment joining them does not intersect any polygon in P . A point p is said to be completely visible from an area source S if p is visible from every point in S . The completely visible region CV(S, P) from S with respect to P is defined as the set of all points in three-dimensional space that are completely visible from S . We present two algorithms for computing CV(S, P) for P with a total of n vertices and a convex polygonal source S with m vertices. Our first result is a divide-and-conquer algorithm which runs in O(m 2 n 2 α(mn)) time and space, where α(mn) is the inverse of Ackermann's function. We next give an incremental algorithm for computing CV(S,P) in O(m 2 n+mn 2 α(n)) time and O(mn+n 2 ) space. We also prove that CV(S,P) consists of Θ(mn+n 2 ) surface elements such as vertices, edges, and faces.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/PL00009193
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    facet.materialart.
    Unknown
    A Draft Sequence for the Genome of the Domesticated Silkworm ( Bombyx mori ) (2004)
    American Association for the Advancement of Science
    Details
    Publication Date: 2004-12-10
    Print ISSN: 0036-8075
    Electronic ISSN: 1095-9203
    Topics: Biology , Chemistry and Pharmacology , Computer Science , Medicine , Natural Sciences in General , Physics
    Published by American Association for the Advancement of Science
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 5
    Electronic Resource
    Electronic Resource
    Resolving Ambiguous Segmentation of Korean Compound Nouns Using Statistics and Rules (1999)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Computational intelligence 15 (1999), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Korean compound nouns may be written as a sequence of characters without blanks between unit nouns. For Korean processing systems, Korean compound nouns have to be first segmented into a sequence of unit nouns. However, the segmentation task is difficult because a sequence of characters may be ambiguously segmented to several sequences of appropriate unit nouns. Moreover, this task is not trivial because Korean compound nouns may include many unknown unit nouns.This paper proposes a new method for KCNS (Korean Compound Noun Segmentation) and reports on the appliccation of such a segmentationtechnique to enhance the performance of an information retrieval system. According to our method, compound nouns are first segmented by using a dictionary and structure patterns. If they are ambiguously segmented, we resolve the ambiguities by using statistical information and a preference rule. Moreover, we employ three kinds of heuristics in order to segment compound nouns with unknown unit nouns.To evaluate KCNS, we use three kinds of data from various domains. Experimental results show that the precision of KCNS's output is approximately 96% on average, regardless of domains. The effectiveness of using the segmented unit nouns provided by KCNS for indexing is proved by improving retrieval performance of our information retrieval system.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0824-7935.00086
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    FEATURE-BASED KOREAN GRAMMAR UTILIZING LEARNED CONSTRAINT RULES (2005)
    Boston, USA and Oxford, UK : Blackwell Publishing, Inc.
    Computational intelligence 21 (2005), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: In this paper, we propose a feature-based Korean grammar utilizing the learned constraint rules in order to improve parsing efficiency. The proposed grammar consists of feature structures, feature operations, and constraint rules; and it has the following characteristics. First, a feature structure includes several features to express useful linguistic information for Korean parsing. Second, a feature operation generating a new feature structure is restricted to the binary-branching form which can deal with Korean properties such as variable word order and constituent ellipsis. Third, constraint rules improve efficiency by preventing feature operations from generating spurious feature structures. Moreover, these rules are learned from a Korean treebank by a decision tree learning algorithm. The experimental results show that the feature-based Korean grammar can reduce the number of candidates by a third of candidates at most and it runs 1.5 ∼ 2 times faster than a CFG on a statistical parser.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0824-7935.2005.00265.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    The use of the Internet for business: the experience of early adopters in Singapore (1997)
    Bingley : Emerald
    Internet research 7 (1997), S. 217-228 
    Details
    ISSN: 1066-2243
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: Focuses on business firms in Singapore, identifying the industries in which the Internet is being used for business. These firms are early adopters in the local environment where use of the Internet for business is a new phenomenon still, and they provide information about their Internet experience in terms of their use, perceptions, and the problems encountered. Finds that companies in seven major industries lead in the business use of the Internet in Singapore: computer and information technology; hospitality; manufacturing; travel; retail; publications; and banking and finance. Most of the survey respondents use the Internet for marketing and advertising, customer service and support, information gathering, and, to a lesser degree, electronic transactions. The respondents' perception of the attributes of the Internet are largely positive. The problems encountered by the respondents include difficulty in locating information, rising costs of Internet use, and security.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1108/10662249710171869
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Improving Internet archive service through proxy cache (2003)
    Bingley : Emerald
    Internet research 13 (2003), S. 61-71 
    Details
    ISSN: 1066-2243
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: Traditionally, file transfer protocol (FTP) servers are major archive providers and users apply the Archie server to locate FTP archives. With the extreme popularity of the WWW, Web servers are now important archive providers and users download archives via HTTP. To reduce HTTP traffic, proxy cache servers are deployed on the Internet. However, we find the hit rate of archives in cache servers is quite low. This study proposes a combination of caching and better searching mechanisms to alleviate the problem. We enable a proxy server to automatically collect WWW and FTP archives from its cache, organize them in the form of an FTP directory, and then offer the directory list to the Archie. Accordingly, users can find archives on WWW and FTP servers through the Archie, and they can directly download archives from the proxy server, thus improving the reuse of cached archives. A system was implemented and operated in a real environment to evaluate the approach and results are discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1108/10662240310458387
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    A consensus ranking for information system requirements (1996)
    Bradford : Emerald
    Information management & computer security 4 (1996), S. 10-18 
    Details
    ISSN: 0968-5227
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: In allocating scarce resources to a new information system (IS), a non-trivial task becomes the determination of a best priority ranking of the IS's intangible information requirements. Given a set of individual users' rankings of the information requirements, illustrates, through a real-world case study, a streamlined consensus priority ranking (SCPR) method based on a concept of minimizing the disagreement (distance) between individual rankings. Compared to a traditional weighted ranking method, the SCPR method is easy to understand, systematic and requires no weighting methodology. Thus, the SCPR method can help the system development team make efficient decisions when allocating resources for a new information system.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1108/09685229610114169
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    On the design concepts for CRM system (2003)
    Bingley : Emerald
    Industrial management & data systems 103 (2003), S. 324-331 
    Details
    ISSN: 0263-5577
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science , Economics
    Notes: In the past few years, information technology has stimulated several innovations in the business and marketing fields, and advances in the technology are changing the research surrounding those fields. Recently, focusing topics in the management and marketing field are electronic customer relationship management (CRM) and the practical use of marketing data and information technology. The goal of this article is not to provide an all-inclusive tutorial on CRM but rather to provide fundamental concepts behind CRM and some aspects of the system development process. This article provides a comprehensive review of CRM and marketing data sources, and consider some design concepts for creating an effective CRM system from the viewpoint of practical use of the data sources.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1108/02635570310477370
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...