Sciweavers

3466 search results - page 391 / 694
» Fast computation of special resultants
Sort
View
CAISE
2004
Springer
16 years 7 days ago
Network-based Business Process Management: a Discussion on Embedding Business Logic in Communications Networks
Advanced Business Process Management (BPM) tools enable the decomposition of previously integrated and often ill-defined processes into reusable process modules. These process modu...
Louis-François Pau, Peter H. M. Vervest
IJCGA
1998
74views more  IJCGA 1998»
15 years 6 months ago
Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
We study the following problem: Given a collection A of polyhedral parts in 3D, determine whether there exists a subset S of the parts that can be moved as a rigid body by in nite...
Leonidas J. Guibas, Dan Halperin, Hirohisa Hirukaw...
CORR
2011
Springer
191views Education» more  CORR 2011»
15 years 1 months ago
On Approximating Four Covering and Packing Problems
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman...
WWW
2009
ACM
16 years 7 months ago
Online expansion of rare queries for sponsored search
Sponsored search systems are tasked with matching queries to relevant advertisements. The current state-of-the-art matching algorithms expand the user's query using a variety...
Andrei Z. Broder, Peter Ciccolo, Evgeniy Gabrilovi...
VLSID
2003
IEEE
167views VLSI» more  VLSID 2003»
16 years 7 months ago
Timing Minimization by Statistical Timing hMetis-based Partitioning
In this paper we present statistical timing driven hMetisbased partitioning. We approach timing driven partitioning from a different perspective: we use the statistical timing cri...
Cristinel Ababei, Kia Bazargan