Sciweavers

488 search results - page 97 / 98
» Automorphic Decompositions of Graphs
Sort
View
STACS
2005
Springer
13 years 11 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
SMA
2003
ACM
169views Solid Modeling» more  SMA 2003»
13 years 11 months ago
Surface reconstruction of freeform objects based on multiresolution volumetric method
3D scanners developed over the past several decades have facilitated the reconstruction of complicated engineering parts. Typically the boundary representation of a part is recons...
Sergei Azernikov, Alex Miropolsky, Anath Fischer
SPAA
2003
ACM
13 years 11 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
ECOOPW
1997
Springer
13 years 10 months ago
The Object Model for a Product Based Development Process
The traditional workflow process model is typically illustrated with a graph of activities, tasks, deliverables and techniques. From an object-oriented perspective, every identifi...
Pavel Hruby
CP
2008
Springer
13 years 7 months ago
A Constraint Programming Approach for Allocation and Scheduling on the CELL Broadband Engine
The Cell BE processor provides both scalable computation power and flexibility, and it is already being adopted for many computational intensive applications like aerospace, defens...
Luca Benini, Michele Lombardi, Michela Milano, Mar...