Sciweavers

2251 search results - page 352 / 451
» Specification and Implementation Problems for C
Sort
View
CDC
2008
IEEE
15 years 11 months ago
Convex duality and entropy-based moment closures: Characterizing degenerate densities
A common method for constructing a function from a finite set of moments is to solve a constrained minimization problem. The idea is to find, among all functions with the given ...
Cory D. Hauck, C. David Levermore, André L....
IUI
2006
ACM
15 years 11 months ago
SWISH: semantic analysis of window titles and switching history
Information workers are often involved in multiple tasks and activities that they must perform in parallel or in rapid succession. In consequence, task management itself becomes y...
Nuria Oliver, Greg Smith, Chintan Thakkar, Arun C....
CGF
2006
125views more  CGF 2006»
15 years 5 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels
SIAMJO
2002
133views more  SIAMJO 2002»
15 years 4 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
142
Voted
SOSP
2003
ACM
16 years 2 months ago
SplitStream: high-bandwidth multicast in cooperative environments
In tree-based multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are highlyava...
Miguel Castro, Peter Druschel, Anne-Marie Kermarre...