2430 search results - page 447 / 486 » Computing Tutte Polynomials |
165
click to vote
QEST
2008
IEEE
16 years 26 days ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
187
click to vote
ICC
2007
IEEE
16 years 24 days ago
2007
IEEE
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
211
click to vote
ICPPW
2007
IEEE
16 years 24 days ago
2007
IEEE
We study the role of task-level scheduling in power management on multicore multiple voltage embedded systems. Multicore on-achip, in particular DSP systems, can greatly improve p...
160
click to vote
PG
2007
IEEE
16 years 23 days ago
2007
IEEE
A new geometry-based finite difference method for a fast and reliable detection of perceptually salient curvature extrema on surfaces approximated by dense triangle meshes is pro...
189
click to vote
ASIACRYPT
2007
Springer
16 years 20 days ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...