Sciweavers

26071 search results - page 5000 / 5215
» Making the
Sort
View
EC
1998
112views ECommerce» more  EC 1998»
15 years 4 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
IPM
2002
106views more  IPM 2002»
15 years 4 months ago
A feature mining based approach for the classification of text documents into disjoint classes
This paper proposes a new approach for classifying text documents into two disjoint classes. The new approach is based on extracting patterns, in the form of two logical expressio...
Salvador Nieto Sánchez, Evangelos Triantaph...
IR
2002
15 years 4 months ago
An Empirical Analysis of Design Choices in Neighborhood-Based Collaborative Filtering Algorithms
Collaborative filtering systems predict a user's interest in new items based on the recommendations of other people with similar interests. Instead of performing content index...
Jonathan L. Herlocker, Joseph A. Konstan, John Rie...
ELECTRONICMARKETS
1998
117views more  ELECTRONICMARKETS 1998»
15 years 4 months ago
Towards Open Electronic Contracting
AbstractAbstractAbstractAbstract A design and pilot implementation of a system, called InterProcs, supporting electronic contracting is presented. A key concept in the design of th...
Ronald M. Lee
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
15 years 4 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
« Prev « First page 5000 / 5215 Last » Next »