6575 search results - page 386 / 1315 » Specializing visualization algorithms |
180
click to vote
TON
2008
15 years 6 months ago
2008
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
199
click to vote
EWSN
2010
Springer
15 years 12 months ago
2010
Springer
One unfortunate consequence of the success story of wireless sensor networks (WSNs) in separate research communities is an evergrowing gap between theory and practice. Even though ...
157
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
195
click to vote
UAI
2003
15 years 8 months ago
2003
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
255
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...