Sciweavers

1964 search results - page 163 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
SIGGRAPH
1999
ACM
14 years 11 days ago
LDI Tree: A Hierarchical Representation for Image-Based Rendering
Using multiple reference images in 3D image warping has been a challenging problem. Recently, the Layered Depth Image (LDI) was proposed by Shade et al. to merge multiple referenc...
Chun-Fa Chang, Gary Bishop, Anselmo Lastra
IPPS
2007
IEEE
14 years 2 months ago
Evolution of Strategy Driven Behavior in Ad Hoc Networks Using a Genetic Algorithm
In this paper we address the problem of selfish behavior in ad hoc networks. We propose a strategy driven approach which aims at enforcing cooperation between network participant...
Marcin Seredynski, Pascal Bouvry, Mieczyslaw A. Kl...
CDC
2008
IEEE
206views Control Systems» more  CDC 2008»
14 years 2 months ago
Approximate dynamic programming using support vector regression
— This paper presents a new approximate policy iteration algorithm based on support vector regression (SVR). It provides an overview of commonly used cost approximation architect...
Brett Bethke, Jonathan P. How, Asuman E. Ozdaglar
DBSEC
2006
134views Database» more  DBSEC 2006»
13 years 9 months ago
Aggregation Queries in the Database-As-a-Service Model
In the Database-As-a-Service (DAS) model, clients store their database contents at servers belonging to potentially untrusted service providers. To maintain data confidentiality, ...
Einar Mykletun, Gene Tsudik
SIAMDM
2008
119views more  SIAMDM 2008»
13 years 8 months ago
On the Graph Bisection Cut Polytope
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...