1355 search results - page 173 / 271 » Alternating Timed Automata over Bounded Time |
131
Voted
CASC
2010
Springer
15 years 2 months ago
2010
Springer
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
108
click to vote
WINE
2007
Springer
15 years 9 months ago
2007
Springer
We introduce an exploration scheme aimed at learning advertiser click-through rates in sponsored search auctions with minimal effect on advertiser incentives. The scheme preserves...
123
Voted
IMR
2004
Springer
15 years 8 months ago
2004
Springer
Generating large 3D unstructured meshes with over 1 billion elements has been a challenging task. Fortunately, for a large class of applications with relatively simple geometries,...
135
click to vote
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
130
Voted
COMPGEOM
2003
ACM
15 years 8 months ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...