Sciweavers

1439 search results - page 93 / 288
» Fast approximation of centrality
Sort
View
JAIR
2006
122views more  JAIR 2006»
14 years 10 months ago
Solving Factored MDPs with Hybrid State and Action Variables
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
Branislav Kveton, Milos Hauskrecht, Carlos Guestri...
JCP
2008
128views more  JCP 2008»
14 years 10 months ago
Life Cycle for Change Management in Business Processes using Semantic Technologies
In a fast changing market environment the task of reducing the downtime for change management of business processes has high importance. Ensuring that IT reflects the updated busin...
Uttam Kumar Tripathi, Knut Hinkelmann, Daniela Fel...
ICCV
2009
IEEE
14 years 7 months ago
Learning image similarity from Flickr groups using Stochastic Intersection Kernel MAchines
Measuring image similarity is a central topic in computer vision. In this paper, we learn similarity from Flickr groups and use it to organize photos. Two images are similar if th...
Gang Wang, Derek Hoiem, David A. Forsyth
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
15 years 2 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov
TAMC
2007
Springer
15 years 4 months ago
Approximation Algorithms for 3D Orthogonal Knapsack
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf ...