Sciweavers

1732 search results - page 57 / 347
» Sequences of Level 1, 2, 3, ..., k , ..
Sort
View
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
16 years 6 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
SOFSEM
2007
Springer
16 years 9 days ago
Exact Max 2-Sat: Easier and Faster
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
Martin Fürer, Shiva Prasad Kasiviswanathan
CVPR
2010
IEEE
15 years 11 months ago
Dynamic Surface Matching by Geodesic Mapping for 3D Animation Transfer
This paper presents a novel approach that achieves complete matching of 3D dynamic surfaces. Surfaces are captured from multi-view video data and represented by sequences of 3D ma...
Tony Tung, Takashi Matsuyama
MP
2002
95views more  MP 2002»
15 years 5 months ago
The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs
We consider a class of non-linear mixed integer programs with n integer variables and k continuous variables. Solving instances from this class to optimality is an NP-hard problem....
Giovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeging...
ICSE
2003
IEEE-ACM
16 years 6 months ago
Architectural Level Risk Assessment Tool Based on UML Specifications
Recent evidences indicate that most faults in software systems are found in only a few of a system's components [1]. The early identification of these components allows an or...
T. Wang, Ahmed E. Hassan, Ajith Guedem, Walid Abde...