Sciweavers

1086 search results - page 105 / 218
» Programming by Numbers: A Programming Method for Novices
Sort
View
ICALP
2001
Springer
15 years 10 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
ISPAN
1997
IEEE
15 years 10 months ago
CASS: an efficient task management system for distributed memory architectures
The thesis of this research is that the task of exposing the parallelism in a given application should be left to the algorithm designer, who has intimate knowledge of the applica...
Jing-Chiou Liou, Michael A. Palis
JMLR
2006
150views more  JMLR 2006»
15 years 6 months ago
Exact 1-Norm Support Vector Machines Via Unconstrained Convex Differentiable Minimization
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...
Olvi L. Mangasarian
JMLR
2010
102views more  JMLR 2010»
15 years 1 months ago
Efficient Algorithms for Conditional Independence Inference
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...
Remco R. Bouckaert, Raymond Hemmecke, Silvia Lindn...
WWW
2003
ACM
16 years 7 months ago
Adaptive ranking of web pages
In this paper, we consider the possibility of altering the PageRank of web pages, from an administrator's point of view, through the modification of the PageRank equation. It...
Ah Chung Tsoi, Gianni Morini, Franco Scarselli, Ma...