Sciweavers

204 search results - page 28 / 41
» A Half-Million Strong at Least
Sort
View
JDA
2008
94views more  JDA 2008»
14 years 9 months ago
Approximability of partitioning graphs with supply and demand
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Ni...
JIS
2006
114views more  JIS 2006»
14 years 9 months ago
Working with information: information management and culture in a professional services organization
The paper presents a case study of a large Canadian law firm with a distinctive information culture that is vigorously implementing an information management strategy. Our finding...
Chun Wei Choo, Colin Furness, Scott Paquette, Herm...
SIGIR
2008
ACM
14 years 9 months ago
Exploiting subjectivity analysis in blogs to improve political leaning categorization
In this paper, we address a relatively new and interesting text categorization problem: classify a political blog as either liberal or conservative, based on its political leaning...
Maojin Jiang, Shlomo Argamon
IJCV
2007
211views more  IJCV 2007»
14 years 9 months ago
The CLEF 2005 Automatic Medical Image Annotation Task
In this paper, the automatic annotation task of the 2005 CLEF cross-language image retrieval campaign (ImageCLEF) is described. This paper focuses on the database used, the task s...
Thomas Deselaers, Henning Müller, Paul Clough...
69
Voted
AI
2002
Springer
14 years 9 months ago
Programming backgammon using self-teaching neural nets
TD-Gammon is a neural network that is able to teach itself to play backgammon solely by playing against itself and learning from the results. Starting from random initial play, TD...
Gerald Tesauro