Sciweavers

1208 search results - page 93 / 242
» Uniform eventown problems
Sort
View
CPC
2006
116views more  CPC 2006»
14 years 10 months ago
Finding Large Independent Sets in Polynomial Expected Time
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
Amin Coja-Oghlan
CORR
2007
Springer
82views Education» more  CORR 2007»
14 years 10 months ago
Sorting and Selection with Random Costs
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
Stanislav Angelov, Keshav Kunal, Andrew McGregor
JSCIC
2008
62views more  JSCIC 2008»
14 years 10 months ago
Robustness of a Spline Element Method with Constraints
The spline element method with constraints is a discretization method where the unknowns are expanded as polynomials on each element and Lagrange multipliers are used to enforce th...
Gerard Awanou
ML
2006
ACM
149views Machine Learning» more  ML 2006»
14 years 10 months ago
A case based approach to expressivity-aware tempo transformation
The research presented in this paper is focused on global tempo transformations of music performances. We are investigating the problem of how a performance played at a particular...
Maarten Grachten, Josep Lluís Arcos, Ramon ...
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 8 months ago
Learning Networks of Stochastic Differential Equations
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...
José Bento, Morteza Ibrahimi, Andrea Montan...