Sciweavers

6582 search results - page 93 / 1317
» The focus of attention problem
Sort
View
JMLR
2006
124views more  JMLR 2006»
15 years 6 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
SIAMSC
2010
192views more  SIAMSC 2010»
15 years 4 months ago
Adaptive Discontinuous Galerkin Methods for Eigenvalue Problems Arising in Incompressible Fluid Flows
In this article we consider the a posteriori error estimation and adaptive mesh refinement of discontinuous Galerkin finite element approximations of the hydrodynamic stability p...
K. Andrew Cliffe, Edward J. C. Hall, Paul Houston
ECIS
2004
15 years 7 months ago
The problem of integrating ethics into IS practice
In this paper we discuss a number of implications which follow from the way that the information systems discipline has developed, largely separately, from computer ethics. These ...
Frances Bell, Alison Adam
COMPULOG
1999
Springer
15 years 10 months ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták
COCOA
2008
Springer
15 years 8 months ago
Strong Formulations for 2-Node-Connected Steiner Network Problems
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...